/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 06:48:17,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 06:48:17,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 06:48:17,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 06:48:17,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 06:48:17,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 06:48:17,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 06:48:17,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 06:48:17,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 06:48:17,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 06:48:17,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 06:48:17,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 06:48:17,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 06:48:17,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 06:48:17,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 06:48:17,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 06:48:17,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 06:48:17,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 06:48:17,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 06:48:17,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 06:48:17,540 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 06:48:17,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 06:48:17,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 06:48:17,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 06:48:17,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 06:48:17,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 06:48:17,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 06:48:17,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 06:48:17,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 06:48:17,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 06:48:17,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 06:48:17,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 06:48:17,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 06:48:17,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 06:48:17,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 06:48:17,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 06:48:17,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 06:48:17,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 06:48:17,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 06:48:17,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 06:48:17,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 06:48:17,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 06:48:17,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 06:48:17,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 06:48:17,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 06:48:17,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 06:48:17,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 06:48:17,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 06:48:17,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 06:48:17,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 06:48:17,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 06:48:17,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 06:48:17,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 06:48:17,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 06:48:17,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 06:48:17,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 06:48:17,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 06:48:17,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 06:48:17,572 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 06:48:17,572 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 06:48:17,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 06:48:17,573 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 06:48:17,573 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 06:48:17,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 06:48:17,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 06:48:17,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 06:48:17,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 06:48:17,832 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 06:48:17,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-03-19 06:48:17,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9d0870c/7dd53431afff4e34bbf66c9fdc2daa0b/FLAGafd84f8f2 [2022-03-19 06:48:18,249 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 06:48:18,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-03-19 06:48:18,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9d0870c/7dd53431afff4e34bbf66c9fdc2daa0b/FLAGafd84f8f2 [2022-03-19 06:48:18,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc9d0870c/7dd53431afff4e34bbf66c9fdc2daa0b [2022-03-19 06:48:18,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 06:48:18,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 06:48:18,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 06:48:18,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 06:48:18,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 06:48:18,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:48:18" (1/1) ... [2022-03-19 06:48:18,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9ab9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:18, skipping insertion in model container [2022-03-19 06:48:18,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 06:48:18" (1/1) ... [2022-03-19 06:48:18,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 06:48:18,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 06:48:18,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-03-19 06:48:18,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 06:48:18,962 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 06:48:18,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-03-19 06:48:19,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 06:48:19,022 INFO L208 MainTranslator]: Completed translation [2022-03-19 06:48:19,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19 WrapperNode [2022-03-19 06:48:19,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 06:48:19,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 06:48:19,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 06:48:19,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 06:48:19,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 06:48:19,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 06:48:19,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 06:48:19,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 06:48:19,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (1/1) ... [2022-03-19 06:48:19,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 06:48:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:19,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 06:48:19,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 06:48:19,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 06:48:19,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 06:48:19,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 06:48:19,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-03-19 06:48:19,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-19 06:48:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 06:48:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 06:48:19,260 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 06:48:19,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 06:48:19,346 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 06:48:19,644 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-03-19 06:48:19,645 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-03-19 06:48:19,651 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 06:48:19,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 06:48:19,658 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 06:48:19,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:48:19 BoogieIcfgContainer [2022-03-19 06:48:19,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 06:48:19,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 06:48:19,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 06:48:19,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 06:48:19,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 06:48:18" (1/3) ... [2022-03-19 06:48:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215fc496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:48:19, skipping insertion in model container [2022-03-19 06:48:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 06:48:19" (2/3) ... [2022-03-19 06:48:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215fc496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 06:48:19, skipping insertion in model container [2022-03-19 06:48:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 06:48:19" (3/3) ... [2022-03-19 06:48:19,672 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2022-03-19 06:48:19,681 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 06:48:19,681 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 06:48:19,719 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 06:48:19,725 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 06:48:19,725 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 06:48:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 06:48:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-19 06:48:19,748 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:19,748 INFO L500 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, 1] [2022-03-19 06:48:19,749 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-03-19 06:48:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:19,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030463253] [2022-03-19 06:48:19,770 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-03-19 06:48:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:19,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639054763] [2022-03-19 06:48:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:48:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:20,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639054763] [2022-03-19 06:48:20,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639054763] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:20,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:20,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:20,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030463253] [2022-03-19 06:48:20,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030463253] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:20,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:20,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769171037] [2022-03-19 06:48:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:20,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:20,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:20,111 INFO L87 Difference]: Start difference. First operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:20,507 INFO L93 Difference]: Finished difference Result 375 states and 629 transitions. [2022-03-19 06:48:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-03-19 06:48:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:20,526 INFO L225 Difference]: With dead ends: 375 [2022-03-19 06:48:20,527 INFO L226 Difference]: Without dead ends: 218 [2022-03-19 06:48:20,531 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:20,535 INFO L912 BasicCegarLoop]: 216 mSDtfsCounter, 576 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:20,537 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 225 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:48:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-19 06:48:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-03-19 06:48:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.4929577464788732) internal successors, (318), 213 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2022-03-19 06:48:20,595 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2022-03-19 06:48:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:20,595 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2022-03-19 06:48:20,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2022-03-19 06:48:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 06:48:20,598 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:20,598 INFO L500 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, 1] [2022-03-19 06:48:20,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 06:48:20,599 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 1 times [2022-03-19 06:48:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309174476] [2022-03-19 06:48:20,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:20,601 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 2 times [2022-03-19 06:48:20,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:20,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861993364] [2022-03-19 06:48:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:20,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 06:48:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861993364] [2022-03-19 06:48:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861993364] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:20,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:20,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:20,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309174476] [2022-03-19 06:48:20,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309174476] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:20,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:20,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:20,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399072066] [2022-03-19 06:48:20,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:20,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:20,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:20,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:20,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:20,686 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:20,947 INFO L93 Difference]: Finished difference Result 348 states and 521 transitions. [2022-03-19 06:48:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:20,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-03-19 06:48:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:20,958 INFO L225 Difference]: With dead ends: 348 [2022-03-19 06:48:20,958 INFO L226 Difference]: Without dead ends: 243 [2022-03-19 06:48:20,961 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:20,963 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:20,963 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-03-19 06:48:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2022-03-19 06:48:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.4782608695652173) internal successors, (340), 230 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 344 transitions. [2022-03-19 06:48:21,008 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 344 transitions. Word has length 44 [2022-03-19 06:48:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:21,009 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 344 transitions. [2022-03-19 06:48:21,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 344 transitions. [2022-03-19 06:48:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-19 06:48:21,011 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:21,011 INFO L500 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, 1] [2022-03-19 06:48:21,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 06:48:21,012 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 1 times [2022-03-19 06:48:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393017777] [2022-03-19 06:48:21,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 2 times [2022-03-19 06:48:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:21,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903322677] [2022-03-19 06:48:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 06:48:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903322677] [2022-03-19 06:48:21,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903322677] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:21,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393017777] [2022-03-19 06:48:21,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393017777] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321137811] [2022-03-19 06:48:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:21,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:21,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:21,083 INFO L87 Difference]: Start difference. First operand 235 states and 344 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:21,333 INFO L93 Difference]: Finished difference Result 559 states and 849 transitions. [2022-03-19 06:48:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:21,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-03-19 06:48:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:21,336 INFO L225 Difference]: With dead ends: 559 [2022-03-19 06:48:21,336 INFO L226 Difference]: Without dead ends: 335 [2022-03-19 06:48:21,337 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:21,338 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:21,338 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 204 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-03-19 06:48:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2022-03-19 06:48:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4102564102564104) internal successors, (440), 312 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 444 transitions. [2022-03-19 06:48:21,374 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 444 transitions. Word has length 61 [2022-03-19 06:48:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:21,375 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 444 transitions. [2022-03-19 06:48:21,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 444 transitions. [2022-03-19 06:48:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-19 06:48:21,377 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:21,377 INFO L500 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, 1] [2022-03-19 06:48:21,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 06:48:21,378 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 1 times [2022-03-19 06:48:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17269852] [2022-03-19 06:48:21,379 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 2 times [2022-03-19 06:48:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927536673] [2022-03-19 06:48:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:21,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 06:48:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:21,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927536673] [2022-03-19 06:48:21,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927536673] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:21,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17269852] [2022-03-19 06:48:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17269852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371131548] [2022-03-19 06:48:21,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:21,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:21,437 INFO L87 Difference]: Start difference. First operand 317 states and 444 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:21,674 INFO L93 Difference]: Finished difference Result 669 states and 952 transitions. [2022-03-19 06:48:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:21,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-03-19 06:48:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:21,676 INFO L225 Difference]: With dead ends: 669 [2022-03-19 06:48:21,677 INFO L226 Difference]: Without dead ends: 365 [2022-03-19 06:48:21,677 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:21,678 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:21,679 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-03-19 06:48:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 355. [2022-03-19 06:48:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 350 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 492 transitions. [2022-03-19 06:48:21,701 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 492 transitions. Word has length 61 [2022-03-19 06:48:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:21,701 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 492 transitions. [2022-03-19 06:48:21,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 492 transitions. [2022-03-19 06:48:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-19 06:48:21,704 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:21,704 INFO L500 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, 1] [2022-03-19 06:48:21,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 06:48:21,704 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 1 times [2022-03-19 06:48:21,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [116330961] [2022-03-19 06:48:21,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 2 times [2022-03-19 06:48:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:21,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521518780] [2022-03-19 06:48:21,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:21,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 06:48:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:21,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521518780] [2022-03-19 06:48:21,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521518780] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [116330961] [2022-03-19 06:48:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [116330961] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:21,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:21,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533600071] [2022-03-19 06:48:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:21,801 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:21,802 INFO L87 Difference]: Start difference. First operand 355 states and 492 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:22,007 INFO L93 Difference]: Finished difference Result 803 states and 1151 transitions. [2022-03-19 06:48:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:22,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-03-19 06:48:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:22,012 INFO L225 Difference]: With dead ends: 803 [2022-03-19 06:48:22,012 INFO L226 Difference]: Without dead ends: 459 [2022-03-19 06:48:22,013 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:22,014 INFO L912 BasicCegarLoop]: 174 mSDtfsCounter, 295 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:22,015 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 181 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-03-19 06:48:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 433. [2022-03-19 06:48:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.4532710280373833) internal successors, (622), 428 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 626 transitions. [2022-03-19 06:48:22,049 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 626 transitions. Word has length 74 [2022-03-19 06:48:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:22,049 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 626 transitions. [2022-03-19 06:48:22,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 626 transitions. [2022-03-19 06:48:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-19 06:48:22,051 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:22,051 INFO L500 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, 1, 1] [2022-03-19 06:48:22,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 06:48:22,051 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 1 times [2022-03-19 06:48:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652240049] [2022-03-19 06:48:22,053 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 2 times [2022-03-19 06:48:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075987645] [2022-03-19 06:48:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-19 06:48:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:22,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075987645] [2022-03-19 06:48:22,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075987645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:22,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652240049] [2022-03-19 06:48:22,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652240049] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454715545] [2022-03-19 06:48:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:22,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:22,141 INFO L87 Difference]: Start difference. First operand 433 states and 626 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:22,347 INFO L93 Difference]: Finished difference Result 901 states and 1312 transitions. [2022-03-19 06:48:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:22,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-19 06:48:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:22,351 INFO L225 Difference]: With dead ends: 901 [2022-03-19 06:48:22,351 INFO L226 Difference]: Without dead ends: 481 [2022-03-19 06:48:22,352 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:22,354 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:22,355 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 193 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-19 06:48:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2022-03-19 06:48:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 470 states have (on average 1.4340425531914893) internal successors, (674), 470 states have internal predecessors, (674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 678 transitions. [2022-03-19 06:48:22,412 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 678 transitions. Word has length 78 [2022-03-19 06:48:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:22,413 INFO L478 AbstractCegarLoop]: Abstraction has 475 states and 678 transitions. [2022-03-19 06:48:22,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 678 transitions. [2022-03-19 06:48:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-19 06:48:22,415 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:22,415 INFO L500 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] [2022-03-19 06:48:22,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 06:48:22,415 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 1 times [2022-03-19 06:48:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677532281] [2022-03-19 06:48:22,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 2 times [2022-03-19 06:48:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246508482] [2022-03-19 06:48:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-19 06:48:22,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:22,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246508482] [2022-03-19 06:48:22,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246508482] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:22,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677532281] [2022-03-19 06:48:22,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677532281] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100573156] [2022-03-19 06:48:22,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:22,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:22,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:22,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:22,505 INFO L87 Difference]: Start difference. First operand 475 states and 678 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:22,717 INFO L93 Difference]: Finished difference Result 956 states and 1370 transitions. [2022-03-19 06:48:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:22,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-03-19 06:48:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:22,721 INFO L225 Difference]: With dead ends: 956 [2022-03-19 06:48:22,721 INFO L226 Difference]: Without dead ends: 714 [2022-03-19 06:48:22,722 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:22,723 INFO L912 BasicCegarLoop]: 316 mSDtfsCounter, 289 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:22,723 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 323 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-03-19 06:48:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-03-19 06:48:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 709 states have (on average 1.4287729196050776) internal successors, (1013), 709 states have internal predecessors, (1013), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-03-19 06:48:22,772 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-03-19 06:48:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:22,773 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-03-19 06:48:22,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-03-19 06:48:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-19 06:48:22,779 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:22,779 INFO L500 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] [2022-03-19 06:48:22,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 06:48:22,779 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:22,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 1 times [2022-03-19 06:48:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1804374272] [2022-03-19 06:48:22,781 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 2 times [2022-03-19 06:48:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:22,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984878459] [2022-03-19 06:48:22,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:22,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-19 06:48:22,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:22,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984878459] [2022-03-19 06:48:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984878459] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1804374272] [2022-03-19 06:48:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1804374272] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3492934] [2022-03-19 06:48:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:22,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:22,836 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:23,047 INFO L93 Difference]: Finished difference Result 1216 states and 1731 transitions. [2022-03-19 06:48:23,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-03-19 06:48:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:23,051 INFO L225 Difference]: With dead ends: 1216 [2022-03-19 06:48:23,051 INFO L226 Difference]: Without dead ends: 735 [2022-03-19 06:48:23,053 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:23,054 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:23,054 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 204 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-03-19 06:48:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-03-19 06:48:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 730 states have (on average 1.4246575342465753) internal successors, (1040), 730 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-03-19 06:48:23,099 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-03-19 06:48:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:23,099 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-03-19 06:48:23,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,100 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-03-19 06:48:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-19 06:48:23,101 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:23,101 INFO L500 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, 1, 1] [2022-03-19 06:48:23,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 06:48:23,102 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 1 times [2022-03-19 06:48:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087218386] [2022-03-19 06:48:23,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 2 times [2022-03-19 06:48:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092326374] [2022-03-19 06:48:23,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-19 06:48:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092326374] [2022-03-19 06:48:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092326374] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087218386] [2022-03-19 06:48:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087218386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994868957] [2022-03-19 06:48:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:23,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:23,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:23,158 INFO L87 Difference]: Start difference. First operand 735 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:23,357 INFO L93 Difference]: Finished difference Result 1262 states and 1788 transitions. [2022-03-19 06:48:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:23,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-03-19 06:48:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:23,361 INFO L225 Difference]: With dead ends: 1262 [2022-03-19 06:48:23,361 INFO L226 Difference]: Without dead ends: 760 [2022-03-19 06:48:23,362 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:23,365 INFO L912 BasicCegarLoop]: 203 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:23,365 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:23,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-03-19 06:48:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-03-19 06:48:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 755 states have (on average 1.4172185430463575) internal successors, (1070), 755 states have internal predecessors, (1070), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-03-19 06:48:23,411 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-03-19 06:48:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:23,412 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-03-19 06:48:23,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-03-19 06:48:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-19 06:48:23,414 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:23,414 INFO L500 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, 1, 1] [2022-03-19 06:48:23,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 06:48:23,414 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 1 times [2022-03-19 06:48:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679803313] [2022-03-19 06:48:23,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 2 times [2022-03-19 06:48:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:23,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180058046] [2022-03-19 06:48:23,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-03-19 06:48:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:23,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180058046] [2022-03-19 06:48:23,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180058046] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:23,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679803313] [2022-03-19 06:48:23,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679803313] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788948430] [2022-03-19 06:48:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:23,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:23,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:23,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:23,474 INFO L87 Difference]: Start difference. First operand 760 states and 1074 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:23,725 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-03-19 06:48:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-03-19 06:48:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:23,730 INFO L225 Difference]: With dead ends: 1002 [2022-03-19 06:48:23,730 INFO L226 Difference]: Without dead ends: 1000 [2022-03-19 06:48:23,731 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:23,731 INFO L912 BasicCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:23,731 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 171 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-19 06:48:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-03-19 06:48:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 995 states have (on average 1.4221105527638191) internal successors, (1415), 995 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-03-19 06:48:23,793 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-03-19 06:48:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:23,793 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-03-19 06:48:23,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:23,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-03-19 06:48:23,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-03-19 06:48:23,797 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:23,797 INFO L500 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2022-03-19 06:48:23,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 06:48:23,798 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:23,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 1 times [2022-03-19 06:48:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242177366] [2022-03-19 06:48:23,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 2 times [2022-03-19 06:48:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:23,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105316181] [2022-03-19 06:48:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-03-19 06:48:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105316181] [2022-03-19 06:48:23,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105316181] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,855 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:23,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242177366] [2022-03-19 06:48:23,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242177366] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:23,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:23,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778977738] [2022-03-19 06:48:23,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:23,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:23,857 INFO L87 Difference]: Start difference. First operand 1000 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:24,126 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-03-19 06:48:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:24,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-03-19 06:48:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:24,131 INFO L225 Difference]: With dead ends: 2191 [2022-03-19 06:48:24,131 INFO L226 Difference]: Without dead ends: 1196 [2022-03-19 06:48:24,133 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:24,134 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 238 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:24,134 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-03-19 06:48:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-03-19 06:48:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.4378801042571676) internal successors, (1655), 1151 states have internal predecessors, (1655), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-03-19 06:48:24,198 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 169 [2022-03-19 06:48:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:24,198 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-03-19 06:48:24,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-03-19 06:48:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-19 06:48:24,201 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:24,202 INFO L500 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-03-19 06:48:24,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 06:48:24,202 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 1 times [2022-03-19 06:48:24,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:24,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [417182610] [2022-03-19 06:48:24,203 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 2 times [2022-03-19 06:48:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:24,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515938649] [2022-03-19 06:48:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-03-19 06:48:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:24,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515938649] [2022-03-19 06:48:24,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515938649] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:24,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:24,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:24,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:24,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [417182610] [2022-03-19 06:48:24,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [417182610] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:24,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:24,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:24,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284944908] [2022-03-19 06:48:24,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:24,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:24,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:24,259 INFO L87 Difference]: Start difference. First operand 1156 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:24,499 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-03-19 06:48:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:24,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 205 [2022-03-19 06:48:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:24,505 INFO L225 Difference]: With dead ends: 2405 [2022-03-19 06:48:24,505 INFO L226 Difference]: Without dead ends: 1262 [2022-03-19 06:48:24,508 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:24,509 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:24,509 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-03-19 06:48:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-03-19 06:48:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1243 states have (on average 1.421560740144811) internal successors, (1767), 1243 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-03-19 06:48:24,604 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 205 [2022-03-19 06:48:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:24,604 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-03-19 06:48:24,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-03-19 06:48:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-03-19 06:48:24,608 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:24,609 INFO L500 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2022-03-19 06:48:24,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 06:48:24,609 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 1 times [2022-03-19 06:48:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:24,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297298633] [2022-03-19 06:48:24,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 2 times [2022-03-19 06:48:24,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:24,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840881589] [2022-03-19 06:48:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-03-19 06:48:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:24,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840881589] [2022-03-19 06:48:24,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840881589] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:24,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:24,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:24,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:24,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297298633] [2022-03-19 06:48:24,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297298633] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:24,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:24,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549596716] [2022-03-19 06:48:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:24,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:24,664 INFO L87 Difference]: Start difference. First operand 1248 states and 1771 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:24,922 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-03-19 06:48:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 226 [2022-03-19 06:48:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:24,928 INFO L225 Difference]: With dead ends: 2595 [2022-03-19 06:48:24,928 INFO L226 Difference]: Without dead ends: 1360 [2022-03-19 06:48:24,931 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:24,932 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:24,932 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 193 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-19 06:48:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-03-19 06:48:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1343 states have (on average 1.4050632911392404) internal successors, (1887), 1343 states have internal predecessors, (1887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-03-19 06:48:25,040 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 226 [2022-03-19 06:48:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:25,041 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-03-19 06:48:25,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-03-19 06:48:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-03-19 06:48:25,045 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:25,046 INFO L500 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-03-19 06:48:25,046 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 06:48:25,046 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 1 times [2022-03-19 06:48:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:25,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212445702] [2022-03-19 06:48:25,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 2 times [2022-03-19 06:48:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240400341] [2022-03-19 06:48:25,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:25,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:25,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-03-19 06:48:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:25,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240400341] [2022-03-19 06:48:25,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240400341] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:25,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:25,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:25,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:25,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212445702] [2022-03-19 06:48:25,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212445702] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:25,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:25,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900985430] [2022-03-19 06:48:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:25,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:25,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:25,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:25,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:25,109 INFO L87 Difference]: Start difference. First operand 1348 states and 1891 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:25,370 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-03-19 06:48:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:25,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 250 [2022-03-19 06:48:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:25,376 INFO L225 Difference]: With dead ends: 2803 [2022-03-19 06:48:25,376 INFO L226 Difference]: Without dead ends: 1468 [2022-03-19 06:48:25,380 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:25,380 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:25,380 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-03-19 06:48:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-03-19 06:48:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1455 states have (on average 1.3876288659793814) internal successors, (2019), 1455 states have internal predecessors, (2019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-03-19 06:48:25,510 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 250 [2022-03-19 06:48:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:25,510 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-03-19 06:48:25,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-03-19 06:48:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-03-19 06:48:25,515 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:25,515 INFO L500 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2022-03-19 06:48:25,515 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 06:48:25,516 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 1 times [2022-03-19 06:48:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438347347] [2022-03-19 06:48:25,517 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 2 times [2022-03-19 06:48:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:25,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912236534] [2022-03-19 06:48:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-03-19 06:48:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:25,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912236534] [2022-03-19 06:48:25,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912236534] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:25,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:25,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:25,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:25,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438347347] [2022-03-19 06:48:25,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438347347] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:25,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:25,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823281383] [2022-03-19 06:48:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:25,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:25,580 INFO L87 Difference]: Start difference. First operand 1460 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:25,858 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-03-19 06:48:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 250 [2022-03-19 06:48:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:25,866 INFO L225 Difference]: With dead ends: 3043 [2022-03-19 06:48:25,866 INFO L226 Difference]: Without dead ends: 1596 [2022-03-19 06:48:25,870 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:25,872 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:25,872 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 194 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-03-19 06:48:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-03-19 06:48:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1579 states have (on average 1.3698543381887271) internal successors, (2163), 1579 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-03-19 06:48:26,002 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 250 [2022-03-19 06:48:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:26,003 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-03-19 06:48:26,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-03-19 06:48:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-03-19 06:48:26,008 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:26,008 INFO L500 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 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, 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] [2022-03-19 06:48:26,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 06:48:26,009 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:26,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 1 times [2022-03-19 06:48:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:26,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143030740] [2022-03-19 06:48:26,011 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 2 times [2022-03-19 06:48:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:26,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478886196] [2022-03-19 06:48:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:26,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-03-19 06:48:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:26,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478886196] [2022-03-19 06:48:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478886196] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:26,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:26,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:26,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:26,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143030740] [2022-03-19 06:48:26,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143030740] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:26,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557010967] [2022-03-19 06:48:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:26,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:26,085 INFO L87 Difference]: Start difference. First operand 1584 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:26,435 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-03-19 06:48:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 280 [2022-03-19 06:48:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:26,449 INFO L225 Difference]: With dead ends: 4722 [2022-03-19 06:48:26,450 INFO L226 Difference]: Without dead ends: 3151 [2022-03-19 06:48:26,454 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:26,454 INFO L912 BasicCegarLoop]: 326 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:26,455 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-03-19 06:48:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-03-19 06:48:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3144 states have (on average 1.3689567430025444) internal successors, (4304), 3144 states have internal predecessors, (4304), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-03-19 06:48:26,668 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 280 [2022-03-19 06:48:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:26,668 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-03-19 06:48:26,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-03-19 06:48:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-03-19 06:48:26,678 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:26,678 INFO L500 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 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, 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] [2022-03-19 06:48:26,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 06:48:26,678 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 1 times [2022-03-19 06:48:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:26,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582480159] [2022-03-19 06:48:26,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 2 times [2022-03-19 06:48:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762849692] [2022-03-19 06:48:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-03-19 06:48:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:26,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762849692] [2022-03-19 06:48:26,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762849692] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:26,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:26,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:26,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582480159] [2022-03-19 06:48:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582480159] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:26,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:26,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58505949] [2022-03-19 06:48:26,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:26,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:26,751 INFO L87 Difference]: Start difference. First operand 3149 states and 4308 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:27,182 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-03-19 06:48:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 280 [2022-03-19 06:48:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:27,198 INFO L225 Difference]: With dead ends: 6585 [2022-03-19 06:48:27,199 INFO L226 Difference]: Without dead ends: 3449 [2022-03-19 06:48:27,206 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:27,208 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:27,208 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 194 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-03-19 06:48:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-03-19 06:48:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3428 states have (on average 1.3500583430571762) internal successors, (4628), 3428 states have internal predecessors, (4628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-03-19 06:48:27,441 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 280 [2022-03-19 06:48:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:27,441 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-03-19 06:48:27,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-03-19 06:48:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-03-19 06:48:27,450 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:27,451 INFO L500 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:48:27,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 06:48:27,451 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:27,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 1 times [2022-03-19 06:48:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029660451] [2022-03-19 06:48:27,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 2 times [2022-03-19 06:48:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:27,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192453562] [2022-03-19 06:48:27,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-03-19 06:48:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192453562] [2022-03-19 06:48:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192453562] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:27,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029660451] [2022-03-19 06:48:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029660451] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774222219] [2022-03-19 06:48:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:27,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:27,520 INFO L87 Difference]: Start difference. First operand 3433 states and 4632 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:27,922 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-03-19 06:48:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 304 [2022-03-19 06:48:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:27,937 INFO L225 Difference]: With dead ends: 7001 [2022-03-19 06:48:27,937 INFO L226 Difference]: Without dead ends: 3581 [2022-03-19 06:48:27,949 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:27,950 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:27,950 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-03-19 06:48:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-03-19 06:48:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3560 states have (on average 1.3426966292134832) internal successors, (4780), 3560 states have internal predecessors, (4780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-03-19 06:48:28,201 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 304 [2022-03-19 06:48:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:28,201 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-03-19 06:48:28,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-03-19 06:48:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-03-19 06:48:28,210 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:28,210 INFO L500 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-19 06:48:28,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 06:48:28,211 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:28,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 1 times [2022-03-19 06:48:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:28,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791490627] [2022-03-19 06:48:28,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 2 times [2022-03-19 06:48:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494130091] [2022-03-19 06:48:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-03-19 06:48:28,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:28,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494130091] [2022-03-19 06:48:28,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494130091] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:28,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:28,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:28,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:28,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791490627] [2022-03-19 06:48:28,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791490627] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:28,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:28,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228338864] [2022-03-19 06:48:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:28,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:28,280 INFO L87 Difference]: Start difference. First operand 3565 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:28,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:28,701 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-03-19 06:48:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 315 [2022-03-19 06:48:28,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:28,729 INFO L225 Difference]: With dead ends: 7517 [2022-03-19 06:48:28,729 INFO L226 Difference]: Without dead ends: 3965 [2022-03-19 06:48:28,738 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:28,739 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:28,739 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-03-19 06:48:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-03-19 06:48:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3872 states have (on average 1.3295454545454546) internal successors, (5148), 3872 states have internal predecessors, (5148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-03-19 06:48:29,061 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 315 [2022-03-19 06:48:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:29,062 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-03-19 06:48:29,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-03-19 06:48:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-03-19 06:48:29,073 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:29,074 INFO L500 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-19 06:48:29,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 06:48:29,075 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:29,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:29,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 1 times [2022-03-19 06:48:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:29,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480409016] [2022-03-19 06:48:29,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 2 times [2022-03-19 06:48:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:29,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922246790] [2022-03-19 06:48:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-03-19 06:48:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:29,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922246790] [2022-03-19 06:48:29,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922246790] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:29,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:29,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:29,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:29,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480409016] [2022-03-19 06:48:29,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480409016] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:29,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:29,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844087820] [2022-03-19 06:48:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:29,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:29,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:29,158 INFO L87 Difference]: Start difference. First operand 3877 states and 5152 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:29,593 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-03-19 06:48:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 329 [2022-03-19 06:48:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:29,606 INFO L225 Difference]: With dead ends: 8149 [2022-03-19 06:48:29,607 INFO L226 Difference]: Without dead ends: 4285 [2022-03-19 06:48:29,614 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:29,616 INFO L912 BasicCegarLoop]: 185 mSDtfsCounter, 279 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:29,616 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 192 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-03-19 06:48:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-03-19 06:48:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3992 states have (on average 1.3256513026052104) internal successors, (5292), 3992 states have internal predecessors, (5292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-03-19 06:48:29,867 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 329 [2022-03-19 06:48:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:29,867 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-03-19 06:48:29,868 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-03-19 06:48:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-03-19 06:48:29,878 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:29,879 INFO L500 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-19 06:48:29,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-19 06:48:29,879 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 1 times [2022-03-19 06:48:29,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:29,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623343773] [2022-03-19 06:48:29,881 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 2 times [2022-03-19 06:48:29,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:29,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070723378] [2022-03-19 06:48:29,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:29,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2022-03-19 06:48:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:29,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070723378] [2022-03-19 06:48:29,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070723378] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:29,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:29,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:29,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:29,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623343773] [2022-03-19 06:48:29,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623343773] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:29,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:29,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339307295] [2022-03-19 06:48:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:29,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:29,967 INFO L87 Difference]: Start difference. First operand 3997 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:30,610 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-03-19 06:48:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 330 [2022-03-19 06:48:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:30,628 INFO L225 Difference]: With dead ends: 11461 [2022-03-19 06:48:30,629 INFO L226 Difference]: Without dead ends: 7477 [2022-03-19 06:48:30,640 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:30,642 INFO L912 BasicCegarLoop]: 317 mSDtfsCounter, 261 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:30,642 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 324 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-19 06:48:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-03-19 06:48:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7470 states have (on average 1.3325301204819278) internal successors, (9954), 7470 states have internal predecessors, (9954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-03-19 06:48:31,127 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 330 [2022-03-19 06:48:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:31,128 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-03-19 06:48:31,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-03-19 06:48:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-03-19 06:48:31,141 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:31,141 INFO L500 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-19 06:48:31,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-19 06:48:31,141 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:31,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 1 times [2022-03-19 06:48:31,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:31,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776540350] [2022-03-19 06:48:31,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 2 times [2022-03-19 06:48:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:31,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821910429] [2022-03-19 06:48:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-03-19 06:48:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821910429] [2022-03-19 06:48:31,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821910429] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:31,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:31,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:31,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:31,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776540350] [2022-03-19 06:48:31,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776540350] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:31,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:31,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995181305] [2022-03-19 06:48:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:31,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:31,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:31,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:31,219 INFO L87 Difference]: Start difference. First operand 7475 states and 9958 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:31,842 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-03-19 06:48:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:31,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 331 [2022-03-19 06:48:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:31,863 INFO L225 Difference]: With dead ends: 14945 [2022-03-19 06:48:31,863 INFO L226 Difference]: Without dead ends: 7483 [2022-03-19 06:48:31,879 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:31,883 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:31,884 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-03-19 06:48:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-03-19 06:48:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7446 states have (on average 1.2992210582863282) internal successors, (9674), 7446 states have internal predecessors, (9674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-03-19 06:48:32,341 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 331 [2022-03-19 06:48:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:32,341 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-03-19 06:48:32,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-03-19 06:48:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-03-19 06:48:32,352 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:32,354 INFO L500 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:48:32,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 06:48:32,354 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 1 times [2022-03-19 06:48:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:32,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1075836047] [2022-03-19 06:48:32,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 2 times [2022-03-19 06:48:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985330768] [2022-03-19 06:48:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-03-19 06:48:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:32,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985330768] [2022-03-19 06:48:32,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985330768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 06:48:32,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038990358] [2022-03-19 06:48:32,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 06:48:32,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:32,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 06:48:32,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 06:48:32,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 06:48:32,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 06:48:32,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-19 06:48:32,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 06:48:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2022-03-19 06:48:33,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 06:48:33,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038990358] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:33,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 06:48:33,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-03-19 06:48:33,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:33,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1075836047] [2022-03-19 06:48:33,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1075836047] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:33,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:33,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:48:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423788660] [2022-03-19 06:48:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:33,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 06:48:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 06:48:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-19 06:48:33,347 INFO L87 Difference]: Start difference. First operand 7451 states and 9678 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:33,918 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-03-19 06:48:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 06:48:33,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 354 [2022-03-19 06:48:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:33,938 INFO L225 Difference]: With dead ends: 15067 [2022-03-19 06:48:33,939 INFO L226 Difference]: Without dead ends: 7601 [2022-03-19 06:48:33,959 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:48:33,960 INFO L912 BasicCegarLoop]: 150 mSDtfsCounter, 249 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:33,960 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 384 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 06:48:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-03-19 06:48:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-03-19 06:48:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7457 states, 7452 states have (on average 1.299248523886205) internal successors, (9682), 7452 states have internal predecessors, (9682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-03-19 06:48:34,477 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 354 [2022-03-19 06:48:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:34,477 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-03-19 06:48:34,477 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-03-19 06:48:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-03-19 06:48:34,488 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:34,489 INFO L500 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 06:48:34,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 06:48:34,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-19 06:48:34,712 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 1 times [2022-03-19 06:48:34,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:34,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [814343120] [2022-03-19 06:48:34,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:34,714 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 2 times [2022-03-19 06:48:34,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:34,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480963154] [2022-03-19 06:48:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:34,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-19 06:48:34,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:34,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480963154] [2022-03-19 06:48:34,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480963154] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 06:48:34,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078767051] [2022-03-19 06:48:34,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 06:48:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:34,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 06:48:34,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 06:48:34,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 06:48:34,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 06:48:34,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 06:48:34,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 06:48:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-19 06:48:35,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 06:48:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-19 06:48:35,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078767051] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 06:48:35,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 06:48:35,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-19 06:48:35,945 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:35,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [814343120] [2022-03-19 06:48:35,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [814343120] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:35,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:35,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:48:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349142679] [2022-03-19 06:48:35,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:35,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 06:48:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:35,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 06:48:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 06:48:35,949 INFO L87 Difference]: Start difference. First operand 7457 states and 9686 transitions. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:37,303 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-03-19 06:48:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 06:48:37,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 367 [2022-03-19 06:48:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:37,329 INFO L225 Difference]: With dead ends: 14825 [2022-03-19 06:48:37,330 INFO L226 Difference]: Without dead ends: 11185 [2022-03-19 06:48:37,339 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-19 06:48:37,340 INFO L912 BasicCegarLoop]: 362 mSDtfsCounter, 336 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:37,340 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-19 06:48:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-03-19 06:48:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-03-19 06:48:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8561 states, 8556 states have (on average 1.3064516129032258) internal successors, (11178), 8556 states have internal predecessors, (11178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-03-19 06:48:37,888 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 367 [2022-03-19 06:48:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:37,889 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-03-19 06:48:37,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:37,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-03-19 06:48:37,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-03-19 06:48:37,903 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:37,904 INFO L500 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-19 06:48:37,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 06:48:38,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-19 06:48:38,120 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 3 times [2022-03-19 06:48:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:38,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195940355] [2022-03-19 06:48:38,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 4 times [2022-03-19 06:48:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:38,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373052012] [2022-03-19 06:48:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:38,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 06:48:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373052012] [2022-03-19 06:48:38,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373052012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 06:48:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563417057] [2022-03-19 06:48:38,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 06:48:38,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:38,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 06:48:38,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 06:48:38,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 06:48:38,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 06:48:38,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 06:48:38,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 06:48:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 06:48:38,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 06:48:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 06:48:39,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563417057] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 06:48:39,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 06:48:39,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-19 06:48:39,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:39,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195940355] [2022-03-19 06:48:39,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195940355] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:39,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:39,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:48:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356479584] [2022-03-19 06:48:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:39,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 06:48:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 06:48:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 06:48:39,398 INFO L87 Difference]: Start difference. First operand 8561 states and 11182 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:40,480 INFO L93 Difference]: Finished difference Result 19299 states and 25058 transitions. [2022-03-19 06:48:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 06:48:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 380 [2022-03-19 06:48:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:40,506 INFO L225 Difference]: With dead ends: 19299 [2022-03-19 06:48:40,507 INFO L226 Difference]: Without dead ends: 10749 [2022-03-19 06:48:40,533 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:48:40,534 INFO L912 BasicCegarLoop]: 202 mSDtfsCounter, 494 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:40,534 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 214 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:48:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2022-03-19 06:48:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 8599. [2022-03-19 06:48:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8599 states, 8594 states have (on average 1.2754247149173843) internal successors, (10961), 8594 states have internal predecessors, (10961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8599 states to 8599 states and 10965 transitions. [2022-03-19 06:48:41,289 INFO L78 Accepts]: Start accepts. Automaton has 8599 states and 10965 transitions. Word has length 380 [2022-03-19 06:48:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:41,290 INFO L478 AbstractCegarLoop]: Abstraction has 8599 states and 10965 transitions. [2022-03-19 06:48:41,290 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8599 states and 10965 transitions. [2022-03-19 06:48:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-03-19 06:48:41,305 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:41,305 INFO L500 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, 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] [2022-03-19 06:48:41,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 06:48:41,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:41,520 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 1 times [2022-03-19 06:48:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189800381] [2022-03-19 06:48:41,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 2 times [2022-03-19 06:48:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:41,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041250616] [2022-03-19 06:48:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:41,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-03-19 06:48:41,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:41,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041250616] [2022-03-19 06:48:41,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041250616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:41,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:41,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:41,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:41,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189800381] [2022-03-19 06:48:41,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189800381] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:41,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:41,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 06:48:41,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570864124] [2022-03-19 06:48:41,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:41,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 06:48:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:41,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 06:48:41,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 06:48:41,609 INFO L87 Difference]: Start difference. First operand 8599 states and 10965 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:42,444 INFO L93 Difference]: Finished difference Result 16055 states and 19918 transitions. [2022-03-19 06:48:42,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 06:48:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 419 [2022-03-19 06:48:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:42,452 INFO L225 Difference]: With dead ends: 16055 [2022-03-19 06:48:42,452 INFO L226 Difference]: Without dead ends: 3851 [2022-03-19 06:48:42,471 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 06:48:42,472 INFO L912 BasicCegarLoop]: 188 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:42,472 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 195 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 06:48:42,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2022-03-19 06:48:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3661. [2022-03-19 06:48:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3656 states have (on average 1.2464442013129102) internal successors, (4557), 3656 states have internal predecessors, (4557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4561 transitions. [2022-03-19 06:48:42,834 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4561 transitions. Word has length 419 [2022-03-19 06:48:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:42,835 INFO L478 AbstractCegarLoop]: Abstraction has 3661 states and 4561 transitions. [2022-03-19 06:48:42,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4561 transitions. [2022-03-19 06:48:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2022-03-19 06:48:42,843 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:42,843 INFO L500 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 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, 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] [2022-03-19 06:48:42,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-19 06:48:42,843 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 1 times [2022-03-19 06:48:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1247103990] [2022-03-19 06:48:42,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 2 times [2022-03-19 06:48:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:42,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114105621] [2022-03-19 06:48:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:42,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-03-19 06:48:42,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114105621] [2022-03-19 06:48:42,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114105621] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 06:48:42,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074652059] [2022-03-19 06:48:42,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 06:48:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:42,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 06:48:42,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 06:48:43,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 06:48:43,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 06:48:43,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 06:48:43,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 06:48:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-03-19 06:48:43,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 06:48:43,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074652059] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:43,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 06:48:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-19 06:48:43,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:43,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1247103990] [2022-03-19 06:48:43,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1247103990] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:43,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:43,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 06:48:43,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810119274] [2022-03-19 06:48:43,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:43,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 06:48:43,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 06:48:43,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 06:48:43,988 INFO L87 Difference]: Start difference. First operand 3661 states and 4561 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:44,282 INFO L93 Difference]: Finished difference Result 4076 states and 5041 transitions. [2022-03-19 06:48:44,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 06:48:44,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 517 [2022-03-19 06:48:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:44,289 INFO L225 Difference]: With dead ends: 4076 [2022-03-19 06:48:44,289 INFO L226 Difference]: Without dead ends: 3999 [2022-03-19 06:48:44,290 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 06:48:44,291 INFO L912 BasicCegarLoop]: 306 mSDtfsCounter, 56 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:44,291 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 462 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 06:48:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2022-03-19 06:48:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3586. [2022-03-19 06:48:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3581 states have (on average 1.246579167830215) internal successors, (4464), 3581 states have internal predecessors, (4464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4468 transitions. [2022-03-19 06:48:44,645 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4468 transitions. Word has length 517 [2022-03-19 06:48:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:44,646 INFO L478 AbstractCegarLoop]: Abstraction has 3586 states and 4468 transitions. [2022-03-19 06:48:44,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4468 transitions. [2022-03-19 06:48:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-03-19 06:48:44,653 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 06:48:44,654 INFO L500 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-03-19 06:48:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 06:48:44,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-19 06:48:44,880 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 06:48:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 06:48:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 1 times [2022-03-19 06:48:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:44,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [419472419] [2022-03-19 06:48:44,883 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 06:48:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 2 times [2022-03-19 06:48:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 06:48:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200636318] [2022-03-19 06:48:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 06:48:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 06:48:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:44,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 06:48:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 06:48:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-19 06:48:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 06:48:44,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200636318] [2022-03-19 06:48:44,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200636318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 06:48:44,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050464038] [2022-03-19 06:48:44,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 06:48:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 06:48:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 06:48:44,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 06:48:44,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 06:48:45,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 06:48:45,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 06:48:45,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 06:48:45,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 06:48:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-19 06:48:45,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 06:48:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-19 06:48:46,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050464038] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 06:48:46,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 06:48:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-03-19 06:48:46,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 06:48:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [419472419] [2022-03-19 06:48:46,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [419472419] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 06:48:46,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 06:48:46,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 06:48:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465423282] [2022-03-19 06:48:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 06:48:46,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 06:48:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 06:48:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 06:48:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 06:48:46,720 INFO L87 Difference]: Start difference. First operand 3586 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 06:48:47,065 INFO L93 Difference]: Finished difference Result 4428 states and 5511 transitions. [2022-03-19 06:48:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 06:48:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 629 [2022-03-19 06:48:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 06:48:47,066 INFO L225 Difference]: With dead ends: 4428 [2022-03-19 06:48:47,066 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 06:48:47,073 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-19 06:48:47,073 INFO L912 BasicCegarLoop]: 225 mSDtfsCounter, 202 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 06:48:47,074 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 237 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 06:48:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 06:48:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 06:48:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 06:48:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 06:48:47,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 629 [2022-03-19 06:48:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 06:48:47,075 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 06:48:47,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 06:48:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 06:48:47,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 06:48:47,077 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 06:48:47,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-19 06:48:47,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-19 06:48:47,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 06:50:16,338 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-03-19 06:50:16,338 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-03-19 06:50:16,338 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-03-19 06:50:16,338 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-03-19 06:50:16,339 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 06:50:16,339 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,339 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 403) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,339 INFO L878 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 06:50:16,339 INFO L878 garLoopResultBuilder]: At program point L399-2(lines 213 496) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 245) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L234-2(lines 213 496) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 548) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L368(lines 368 370) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 337) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,340 INFO L878 garLoopResultBuilder]: At program point L302(lines 302 304) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L236(lines 236 239) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L302-2(lines 300 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 501) the Hoare annotation is: (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (not .cse3) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 4432 ssl3_connect_~s__state~0) .cse1) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse0) (and .cse4 .cse1 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 512) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 523) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-03-19 06:50:16,341 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 108) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L534(lines 534 539) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L534-2(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L138(lines 134 524) 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 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 107) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 538) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,342 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 500) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= 3 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (<= 4432 ssl3_connect_~s__state~0) (and .cse1 (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse3 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 511) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 522) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L372-2(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~blastFlag~0 0)) (.cse3 (= 4496 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse4 .cse3) (and .cse4 .cse2) (and .cse1 .cse3 .cse5) (and .cse1 .cse2 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L240(lines 240 243) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,343 INFO L878 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,344 INFO L878 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,344 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-03-19 06:50:16,344 INFO L878 garLoopResultBuilder]: At program point L274(lines 274 276) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384))) [2022-03-19 06:50:16,344 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-03-19 06:50:16,344 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 510) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-19 06:50:16,344 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 521) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-03-19 06:50:16,344 INFO L878 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L408(lines 408 411) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,345 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 445) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,345 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 346) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,345 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 509) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 520) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 531) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,346 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-03-19 06:50:16,346 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-03-19 06:50:16,346 INFO L878 garLoopResultBuilder]: At program point L446(lines 446 450) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L446-2(lines 446 450) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (= ssl3_connect_~blastFlag~0 0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse4 (not .cse2)) (.cse5 (= 4512 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2) (and .cse1 .cse4 .cse5)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L347(lines 347 351) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L281(lines 281 283) 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 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L347-2(lines 347 351) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__state~0 4464)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~blastFlag~0 0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__cert_req~0 0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse6 (= ssl3_connect_~s__state~0 4480)) (.cse3 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse5 .cse0 .cse1 .cse6) (and .cse5 .cse4 .cse6) (and .cse5 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L281-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 508) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-03-19 06:50:16,347 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 519) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 530) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,348 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L316(lines 316 318) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L250(lines 250 253) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L316-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L416(lines 416 418) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L383(lines 383 385) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,348 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 507) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-03-19 06:50:16,349 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 518) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-19 06:50:16,349 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 529) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,349 INFO L878 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,349 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-03-19 06:50:16,349 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-03-19 06:50:16,349 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-03-19 06:50:16,349 INFO L878 garLoopResultBuilder]: At program point L287(lines 287 291) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,349 INFO L878 garLoopResultBuilder]: At program point L287-2(lines 287 291) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse4 (= 4400 ssl3_connect_~s__state~0)) (.cse6 (= ssl3_connect_~blastFlag~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse4 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse4 .cse6 .cse5)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 506) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 517) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 528) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L223-2(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 505) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-03-19 06:50:16,350 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 516) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 527) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,351 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-03-19 06:50:16,351 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L456(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L423(lines 423 437) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L423-1(lines 423 437) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (not .cse5)) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 (= 3 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L456-2(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 327) the Hoare annotation is: (let ((.cse0 (= 4432 ssl3_connect_~s__state~0))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~blastFlag~0 0) .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,351 INFO L878 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,352 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-03-19 06:50:16,352 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-03-19 06:50:16,352 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L359(lines 359 361) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 504) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 515) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 526) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 395) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,352 INFO L878 garLoopResultBuilder]: At program point L228(lines 228 231) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 102) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L427(lines 427 433) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (not (= ssl3_connect_~s__hit~0 0))) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 268) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 464) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 503) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-03-19 06:50:16,353 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 514) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 525) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L99(lines 99 101) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L99-2(lines 96 102) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 267) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 298 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L265-2(lines 213 496) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 1) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 06:50:16,354 INFO L878 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-19 06:50:16,355 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 334) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-19 06:50:16,355 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 502) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-03-19 06:50:16,355 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 513) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-19 06:50:16,355 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 524) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-19 06:50:16,355 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,355 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,355 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,355 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 06:50:16,358 INFO L718 BasicCegarLoop]: Path program histogram: [4, 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] [2022-03-19 06:50:16,359 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 06:50:16,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 06:50:16 BoogieIcfgContainer [2022-03-19 06:50:16,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 06:50:16,387 INFO L158 Benchmark]: Toolchain (without parser) took 117726.86ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 127.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-19 06:50:16,387 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 89.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 06:50:16,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 151.6MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-19 06:50:16,387 INFO L158 Benchmark]: Boogie Preprocessor took 55.92ms. Allocated memory is still 176.2MB. Free memory was 151.6MB in the beginning and 149.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 06:50:16,387 INFO L158 Benchmark]: RCFGBuilder took 583.49ms. Allocated memory is still 176.2MB. Free memory was 149.1MB in the beginning and 123.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-03-19 06:50:16,388 INFO L158 Benchmark]: TraceAbstraction took 116720.31ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 123.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-19 06:50:16,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 89.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.42ms. Allocated memory is still 176.2MB. Free memory was 126.8MB in the beginning and 151.6MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.92ms. Allocated memory is still 176.2MB. Free memory was 151.6MB in the beginning and 149.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 583.49ms. Allocated memory is still 176.2MB. Free memory was 149.1MB in the beginning and 123.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 116720.31ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 123.4MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 560]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.6s, OverallIterations: 28, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 89.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6895 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6893 mSDsluCounter, 6564 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5703 IncrementalHoareTripleChecker+Invalid, 6244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 5975 mSDtfsCounter, 5703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3823 GetRequests, 3719 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8599occurred in iteration=25, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 6119 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 5003 NumberOfFragments, 11504 HoareAnnotationTreeSize, 137 FomulaSimplifications, 121856 FormulaSimplificationTreeSizeReduction, 24.8s HoareSimplificationTime, 137 FomulaSimplificationsInter, 228919 FormulaSimplificationTreeSizeReductionInter, 64.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((s__hit == 0 && s__state == 4448) && blastFlag <= 4)) || ((3 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4512 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4496 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4464)) || (((s__s3__tmp__next_state___0 <= 4560 && 4400 == s__state) && s__hit == 0) && blastFlag <= 4)) || (2 == blastFlag && 4512 == s__state)) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__state == 4416 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0)) || ((s__hit == 0 && s__state == 4464) && blastFlag <= 4)) || ((4432 == s__state && s__hit == 0) && blastFlag <= 4)) || blastFlag == 0) || ((s__hit == 0 && 4496 == s__state) && blastFlag <= 4)) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((4400 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__state == 4416 && 2 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && 4512 == s__state) && blastFlag <= 4)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || ((s__state == 4528 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4448)) || ((s__state == 4416 && 3 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && s__state == 4480) && blastFlag <= 4)) || ((s__state == 4528 && s__hit == 0) && blastFlag <= 4)) || (blastFlag == 1 && s__state == 4384)) || (s__state == 4528 && 2 == blastFlag) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (12292 <= s__state && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state <= 4560) && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((4352 <= s__state && 3 == blastFlag) && s__state <= 4560) && s__hit == 0) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0) || ((4352 <= s__state && s__state <= 4352) && blastFlag == 0)) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: blastFlag == 0 || !(12292 <= \old(initial_state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (4560 <= s__state && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4560) && blastFlag == 0) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag == 1) && s__state <= 4560) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state)) - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_connect Derived contract for procedure ssl3_connect: 1 - ProcedureContractResult [Line: 564]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 06:50:16,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...