/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_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 18:51:04,394 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 18:51:04,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 18:51:04,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 18:51:04,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 18:51:04,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 18:51:04,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 18:51:04,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 18:51:04,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 18:51:04,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 18:51:04,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 18:51:04,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 18:51:04,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 18:51:04,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 18:51:04,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 18:51:04,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 18:51:04,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 18:51:04,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 18:51:04,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 18:51:04,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 18:51:04,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 18:51:04,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 18:51:04,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 18:51:04,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 18:51:04,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 18:51:04,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 18:51:04,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 18:51:04,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 18:51:04,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 18:51:04,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 18:51:04,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 18:51:04,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 18:51:04,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 18:51:04,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 18:51:04,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 18:51:04,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 18:51:04,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 18:51:04,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 18:51:04,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 18:51:04,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 18:51:04,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 18:51:04,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 18:51:04,500 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 18:51:04,510 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 18:51:04,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 18:51:04,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 18:51:04,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 18:51:04,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 18:51:04,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 18:51:04,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 18:51:04,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 18:51:04,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 18:51:04,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 18:51:04,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 18:51:04,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 18:51:04,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 18:51:04,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 18:51:04,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 18:51:04,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 18:51:04,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 18:51:04,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 18:51:04,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:51:04,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 18:51:04,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 18:51:04,516 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 18:51:04,516 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 18:51:04,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 18:51:04,516 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 18:51:04,516 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-04-06 18:51:04,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 18:51:04,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 18:51:04,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 18:51:04,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 18:51:04,749 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 18:51:04,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-04-06 18:51:04,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cb939b0/c67910f2636e4ae692b788871ab62317/FLAG8a1ae4743 [2022-04-06 18:51:05,214 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 18:51:05,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-04-06 18:51:05,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cb939b0/c67910f2636e4ae692b788871ab62317/FLAG8a1ae4743 [2022-04-06 18:51:05,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cb939b0/c67910f2636e4ae692b788871ab62317 [2022-04-06 18:51:05,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 18:51:05,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 18:51:05,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 18:51:05,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 18:51:05,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 18:51:05,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c41151e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05, skipping insertion in model container [2022-04-06 18:51:05,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 18:51:05,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 18:51:05,848 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_4.cil-1.c[35886,35899] [2022-04-06 18:51:05,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:51:05,872 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 18:51:05,909 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_4.cil-1.c[35886,35899] [2022-04-06 18:51:05,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 18:51:05,922 INFO L208 MainTranslator]: Completed translation [2022-04-06 18:51:05,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05 WrapperNode [2022-04-06 18:51:05,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 18:51:05,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 18:51:05,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 18:51:05,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 18:51:05,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 18:51:05,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 18:51:05,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 18:51:05,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 18:51:05,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (1/1) ... [2022-04-06 18:51:05,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 18:51:06,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:06,037 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-04-06 18:51:06,060 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-04-06 18:51:06,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 18:51:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 18:51:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 18:51:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-06 18:51:06,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 18:51:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 18:51:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 18:51:06,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 18:51:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 18:51:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-06 18:51:06,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 18:51:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-06 18:51:06,085 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 18:51:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 18:51:06,199 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 18:51:06,200 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 18:51:06,302 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-06 18:51:06,572 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-06 18:51:06,572 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-06 18:51:06,575 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 18:51:06,581 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 18:51:06,582 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 18:51:06,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:51:06 BoogieIcfgContainer [2022-04-06 18:51:06,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 18:51:06,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 18:51:06,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 18:51:06,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 18:51:06,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 06:51:05" (1/3) ... [2022-04-06 18:51:06,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d13b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:51:06, skipping insertion in model container [2022-04-06 18:51:06,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:51:05" (2/3) ... [2022-04-06 18:51:06,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d13b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:51:06, skipping insertion in model container [2022-04-06 18:51:06,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:51:06" (3/3) ... [2022-04-06 18:51:06,591 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2022-04-06 18:51:06,595 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 18:51:06,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 18:51:06,631 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 18:51:06,637 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-04-06 18:51:06,637 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 18:51:06,653 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-04-06 18:51:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 18:51:06,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:06,662 INFO L499 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-04-06 18:51:06,663 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-04-06 18:51:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:06,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717510880] [2022-04-06 18:51:06,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-04-06 18:51:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:06,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44588249] [2022-04-06 18:51:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:06,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:51:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:06,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44588249] [2022-04-06 18:51:06,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44588249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:06,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:06,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:06,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:06,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717510880] [2022-04-06 18:51:06,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717510880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:06,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:06,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:06,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036791620] [2022-04-06 18:51:06,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:06,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:06,997 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-04-06 18:51:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:07,421 INFO L93 Difference]: Finished difference Result 376 states and 631 transitions. [2022-04-06 18:51:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:07,423 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-04-06 18:51:07,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:07,432 INFO L225 Difference]: With dead ends: 376 [2022-04-06 18:51:07,433 INFO L226 Difference]: Without dead ends: 219 [2022-04-06 18:51:07,436 INFO L912 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-04-06 18:51:07,439 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 578 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:07,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 224 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 18:51:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-06 18:51:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-04-06 18:51:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 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-04-06 18:51:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-04-06 18:51:07,498 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2022-04-06 18:51:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:07,498 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-04-06 18:51:07,498 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-04-06 18:51:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-04-06 18:51:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 18:51:07,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:07,500 INFO L499 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-04-06 18:51:07,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 18:51:07,501 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 1 times [2022-04-06 18:51:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:07,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764939427] [2022-04-06 18:51:07,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 2 times [2022-04-06 18:51:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:07,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958910666] [2022-04-06 18:51:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 18:51:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:07,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958910666] [2022-04-06 18:51:07,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958910666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:07,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:07,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:07,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:07,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764939427] [2022-04-06 18:51:07,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764939427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:07,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:07,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493816367] [2022-04-06 18:51:07,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:07,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:07,581 INFO L87 Difference]: Start difference. First operand 219 states and 323 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-04-06 18:51:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:07,824 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-04-06 18:51:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:07,828 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-04-06 18:51:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:07,838 INFO L225 Difference]: With dead ends: 349 [2022-04-06 18:51:07,838 INFO L226 Difference]: Without dead ends: 244 [2022-04-06 18:51:07,840 INFO L912 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-04-06 18:51:07,841 INFO L913 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-04-06 18:51:07,842 INFO L914 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-04-06 18:51:07,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-04-06 18:51:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2022-04-06 18:51:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 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-04-06 18:51:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 345 transitions. [2022-04-06 18:51:07,876 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 345 transitions. Word has length 44 [2022-04-06 18:51:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:07,878 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 345 transitions. [2022-04-06 18:51:07,878 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-04-06 18:51:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 345 transitions. [2022-04-06 18:51:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-06 18:51:07,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:07,886 INFO L499 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-04-06 18:51:07,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 18:51:07,886 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 1 times [2022-04-06 18:51:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:07,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519717221] [2022-04-06 18:51:07,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 2 times [2022-04-06 18:51:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:07,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640864719] [2022-04-06 18:51:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:07,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:51:08,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:08,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640864719] [2022-04-06 18:51:08,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640864719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:08,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519717221] [2022-04-06 18:51:08,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519717221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019453583] [2022-04-06 18:51:08,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:08,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:08,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:08,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:08,005 INFO L87 Difference]: Start difference. First operand 236 states and 345 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-04-06 18:51:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:08,273 INFO L93 Difference]: Finished difference Result 561 states and 851 transitions. [2022-04-06 18:51:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:08,274 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-04-06 18:51:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:08,276 INFO L225 Difference]: With dead ends: 561 [2022-04-06 18:51:08,276 INFO L226 Difference]: Without dead ends: 336 [2022-04-06 18:51:08,277 INFO L912 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-04-06 18:51:08,278 INFO L913 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-04-06 18:51:08,278 INFO L914 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-04-06 18:51:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-06 18:51:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 318. [2022-04-06 18:51:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 313 states have (on average 1.4089456869009584) internal successors, (441), 313 states have internal predecessors, (441), 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-04-06 18:51:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2022-04-06 18:51:08,321 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 61 [2022-04-06 18:51:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:08,321 INFO L478 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2022-04-06 18:51:08,321 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-04-06 18:51:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2022-04-06 18:51:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-06 18:51:08,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:08,322 INFO L499 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-04-06 18:51:08,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 18:51:08,323 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 1 times [2022-04-06 18:51:08,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120075406] [2022-04-06 18:51:08,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 2 times [2022-04-06 18:51:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:08,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833402327] [2022-04-06 18:51:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:51:08,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:08,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833402327] [2022-04-06 18:51:08,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833402327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:08,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120075406] [2022-04-06 18:51:08,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120075406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241111027] [2022-04-06 18:51:08,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:08,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:08,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:08,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:08,381 INFO L87 Difference]: Start difference. First operand 318 states and 445 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-04-06 18:51:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:08,602 INFO L93 Difference]: Finished difference Result 673 states and 957 transitions. [2022-04-06 18:51:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:08,603 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-04-06 18:51:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:08,605 INFO L225 Difference]: With dead ends: 673 [2022-04-06 18:51:08,605 INFO L226 Difference]: Without dead ends: 368 [2022-04-06 18:51:08,606 INFO L912 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-04-06 18:51:08,607 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 195 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 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-04-06 18:51:08,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-06 18:51:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2022-04-06 18:51:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.393162393162393) internal successors, (489), 351 states have internal predecessors, (489), 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-04-06 18:51:08,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 493 transitions. [2022-04-06 18:51:08,631 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 493 transitions. Word has length 61 [2022-04-06 18:51:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:08,631 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 493 transitions. [2022-04-06 18:51:08,631 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-04-06 18:51:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 493 transitions. [2022-04-06 18:51:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-06 18:51:08,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:08,632 INFO L499 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-04-06 18:51:08,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 18:51:08,633 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 1 times [2022-04-06 18:51:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706819515] [2022-04-06 18:51:08,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:08,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 2 times [2022-04-06 18:51:08,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:08,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242917209] [2022-04-06 18:51:08,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:08,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-06 18:51:08,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:08,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242917209] [2022-04-06 18:51:08,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242917209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:08,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706819515] [2022-04-06 18:51:08,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706819515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:08,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:08,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401535942] [2022-04-06 18:51:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:08,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:08,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:08,687 INFO L87 Difference]: Start difference. First operand 356 states and 493 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-04-06 18:51:08,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:08,917 INFO L93 Difference]: Finished difference Result 805 states and 1153 transitions. [2022-04-06 18:51:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:08,918 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-04-06 18:51:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:08,920 INFO L225 Difference]: With dead ends: 805 [2022-04-06 18:51:08,920 INFO L226 Difference]: Without dead ends: 460 [2022-04-06 18:51:08,921 INFO L912 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-04-06 18:51:08,921 INFO L913 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-04-06 18:51:08,922 INFO L914 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-04-06 18:51:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-04-06 18:51:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 434. [2022-04-06 18:51:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 1.4522144522144522) internal successors, (623), 429 states have internal predecessors, (623), 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-04-06 18:51:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 627 transitions. [2022-04-06 18:51:08,952 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 627 transitions. Word has length 74 [2022-04-06 18:51:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:08,952 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 627 transitions. [2022-04-06 18:51:08,952 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-04-06 18:51:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 627 transitions. [2022-04-06 18:51:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-06 18:51:08,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:08,954 INFO L499 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-04-06 18:51:08,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 18:51:08,954 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 1 times [2022-04-06 18:51:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:08,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1375041199] [2022-04-06 18:51:08,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 2 times [2022-04-06 18:51:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:08,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183763453] [2022-04-06 18:51:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 18:51:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183763453] [2022-04-06 18:51:09,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183763453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:09,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1375041199] [2022-04-06 18:51:09,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1375041199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839332088] [2022-04-06 18:51:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:09,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:09,053 INFO L87 Difference]: Start difference. First operand 434 states and 627 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-04-06 18:51:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:09,298 INFO L93 Difference]: Finished difference Result 903 states and 1314 transitions. [2022-04-06 18:51:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:09,298 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-04-06 18:51:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:09,303 INFO L225 Difference]: With dead ends: 903 [2022-04-06 18:51:09,303 INFO L226 Difference]: Without dead ends: 482 [2022-04-06 18:51:09,304 INFO L912 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-04-06 18:51:09,306 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-06 18:51:09,307 INFO L914 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-04-06 18:51:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-04-06 18:51:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2022-04-06 18:51:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 471 states have (on average 1.4331210191082802) internal successors, (675), 471 states have internal predecessors, (675), 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-04-06 18:51:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 679 transitions. [2022-04-06 18:51:09,335 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 679 transitions. Word has length 78 [2022-04-06 18:51:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:09,337 INFO L478 AbstractCegarLoop]: Abstraction has 476 states and 679 transitions. [2022-04-06 18:51:09,337 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-04-06 18:51:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 679 transitions. [2022-04-06 18:51:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-06 18:51:09,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:09,339 INFO L499 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-04-06 18:51:09,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 18:51:09,339 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:09,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 1 times [2022-04-06 18:51:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:09,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1068459034] [2022-04-06 18:51:09,340 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 2 times [2022-04-06 18:51:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:09,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095563485] [2022-04-06 18:51:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:09,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-06 18:51:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:09,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095563485] [2022-04-06 18:51:09,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095563485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1068459034] [2022-04-06 18:51:09,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1068459034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718464260] [2022-04-06 18:51:09,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:09,422 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:09,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:09,422 INFO L87 Difference]: Start difference. First operand 476 states and 679 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-04-06 18:51:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:09,658 INFO L93 Difference]: Finished difference Result 956 states and 1369 transitions. [2022-04-06 18:51:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:09,658 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-04-06 18:51:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:09,662 INFO L225 Difference]: With dead ends: 956 [2022-04-06 18:51:09,663 INFO L226 Difference]: Without dead ends: 714 [2022-04-06 18:51:09,663 INFO L912 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-04-06 18:51:09,664 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 287 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:09,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 324 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-04-06 18:51:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-04-06 18:51:09,700 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-04-06 18:51:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-04-06 18:51:09,703 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-04-06 18:51:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:09,703 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-04-06 18:51:09,703 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-04-06 18:51:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-04-06 18:51:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-06 18:51:09,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:09,706 INFO L499 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-04-06 18:51:09,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 18:51:09,706 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 1 times [2022-04-06 18:51:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:09,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486326574] [2022-04-06 18:51:09,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 2 times [2022-04-06 18:51:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:09,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555720063] [2022-04-06 18:51:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-06 18:51:09,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:09,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555720063] [2022-04-06 18:51:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555720063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:09,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486326574] [2022-04-06 18:51:09,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486326574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:09,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:09,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:09,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029837067] [2022-04-06 18:51:09,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:09,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:09,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:09,754 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-04-06 18:51:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:09,975 INFO L93 Difference]: Finished difference Result 1215 states and 1730 transitions. [2022-04-06 18:51:09,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:09,975 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-04-06 18:51:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:09,978 INFO L225 Difference]: With dead ends: 1215 [2022-04-06 18:51:09,978 INFO L226 Difference]: Without dead ends: 735 [2022-04-06 18:51:09,980 INFO L912 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-04-06 18:51:09,981 INFO L913 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-04-06 18:51:09,981 INFO L914 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-04-06 18:51:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-04-06 18:51:10,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-04-06 18:51:10,019 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-04-06 18:51:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-04-06 18:51:10,021 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-04-06 18:51:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:10,022 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-04-06 18:51:10,022 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-04-06 18:51:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-04-06 18:51:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-06 18:51:10,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:10,023 INFO L499 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-04-06 18:51:10,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 18:51:10,024 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 1 times [2022-04-06 18:51:10,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996819961] [2022-04-06 18:51:10,025 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 2 times [2022-04-06 18:51:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102096089] [2022-04-06 18:51:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 18:51:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:10,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102096089] [2022-04-06 18:51:10,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102096089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:10,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996819961] [2022-04-06 18:51:10,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996819961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268394393] [2022-04-06 18:51:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:10,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:10,080 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-04-06 18:51:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:10,289 INFO L93 Difference]: Finished difference Result 1261 states and 1787 transitions. [2022-04-06 18:51:10,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:10,289 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-04-06 18:51:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:10,292 INFO L225 Difference]: With dead ends: 1261 [2022-04-06 18:51:10,293 INFO L226 Difference]: Without dead ends: 760 [2022-04-06 18:51:10,294 INFO L912 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-04-06 18:51:10,294 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:10,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-06 18:51:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-04-06 18:51:10,330 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-04-06 18:51:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-04-06 18:51:10,332 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-04-06 18:51:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:10,333 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-04-06 18:51:10,333 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-04-06 18:51:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-04-06 18:51:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-06 18:51:10,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:10,335 INFO L499 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-04-06 18:51:10,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 18:51:10,335 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 1 times [2022-04-06 18:51:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274492814] [2022-04-06 18:51:10,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:10,336 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 2 times [2022-04-06 18:51:10,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:10,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283385569] [2022-04-06 18:51:10,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-06 18:51:10,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:10,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283385569] [2022-04-06 18:51:10,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283385569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:10,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274492814] [2022-04-06 18:51:10,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274492814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134253407] [2022-04-06 18:51:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:10,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:10,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:10,378 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-04-06 18:51:10,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:10,624 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-04-06 18:51:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:10,624 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-04-06 18:51:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:10,634 INFO L225 Difference]: With dead ends: 1002 [2022-04-06 18:51:10,635 INFO L226 Difference]: Without dead ends: 1000 [2022-04-06 18:51:10,635 INFO L912 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-04-06 18:51:10,636 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:10,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 171 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-04-06 18:51:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-04-06 18:51:10,687 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-04-06 18:51:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-04-06 18:51:10,691 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-04-06 18:51:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:10,691 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-04-06 18:51:10,691 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-04-06 18:51:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-04-06 18:51:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-06 18:51:10,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:10,694 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2022-04-06 18:51:10,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 18:51:10,695 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 1 times [2022-04-06 18:51:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1909438900] [2022-04-06 18:51:10,696 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 2 times [2022-04-06 18:51:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305238157] [2022-04-06 18:51:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-06 18:51:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305238157] [2022-04-06 18:51:10,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305238157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1909438900] [2022-04-06 18:51:10,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1909438900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:10,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449535292] [2022-04-06 18:51:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:10,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:10,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:10,748 INFO L87 Difference]: Start difference. First operand 1000 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 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-04-06 18:51:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:10,985 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-04-06 18:51:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:10,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 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 140 [2022-04-06 18:51:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:10,991 INFO L225 Difference]: With dead ends: 2191 [2022-04-06 18:51:10,991 INFO L226 Difference]: Without dead ends: 1196 [2022-04-06 18:51:10,993 INFO L912 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-04-06 18:51:10,994 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 234 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 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-04-06 18:51:10,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-04-06 18:51:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-04-06 18:51:11,068 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-04-06 18:51:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-04-06 18:51:11,072 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 140 [2022-04-06 18:51:11,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:11,072 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-04-06 18:51:11,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 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-04-06 18:51:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-04-06 18:51:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-06 18:51:11,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:11,076 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 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-04-06 18:51:11,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 18:51:11,076 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 1 times [2022-04-06 18:51:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850170212] [2022-04-06 18:51:11,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:11,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 2 times [2022-04-06 18:51:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:11,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990316274] [2022-04-06 18:51:11,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:11,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-06 18:51:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:11,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990316274] [2022-04-06 18:51:11,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990316274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:11,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850170212] [2022-04-06 18:51:11,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850170212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437858070] [2022-04-06 18:51:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:11,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:11,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:11,135 INFO L87 Difference]: Start difference. First operand 1156 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-04-06 18:51:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:11,373 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-04-06 18:51:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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 176 [2022-04-06 18:51:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:11,379 INFO L225 Difference]: With dead ends: 2405 [2022-04-06 18:51:11,379 INFO L226 Difference]: Without dead ends: 1262 [2022-04-06 18:51:11,384 INFO L912 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-04-06 18:51:11,385 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:11,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-04-06 18:51:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-04-06 18:51:11,470 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-04-06 18:51:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-04-06 18:51:11,474 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 176 [2022-04-06 18:51:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:11,474 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-04-06 18:51:11,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 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-04-06 18:51:11,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-04-06 18:51:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-06 18:51:11,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:11,479 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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-04-06 18:51:11,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 18:51:11,480 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 1 times [2022-04-06 18:51:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [497119620] [2022-04-06 18:51:11,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 2 times [2022-04-06 18:51:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929233694] [2022-04-06 18:51:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-04-06 18:51:11,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:11,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929233694] [2022-04-06 18:51:11,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929233694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [497119620] [2022-04-06 18:51:11,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [497119620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863919746] [2022-04-06 18:51:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:11,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:11,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:11,536 INFO L87 Difference]: Start difference. First operand 1248 states and 1771 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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-04-06 18:51:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:11,788 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-04-06 18:51:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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 197 [2022-04-06 18:51:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:11,793 INFO L225 Difference]: With dead ends: 2595 [2022-04-06 18:51:11,793 INFO L226 Difference]: Without dead ends: 1360 [2022-04-06 18:51:11,796 INFO L912 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-04-06 18:51:11,796 INFO L913 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-04-06 18:51:11,797 INFO L914 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-04-06 18:51:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-04-06 18:51:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-04-06 18:51:11,865 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-04-06 18:51:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-04-06 18:51:11,869 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 197 [2022-04-06 18:51:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:11,869 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-04-06 18:51:11,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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-04-06 18:51:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-04-06 18:51:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-06 18:51:11,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:11,873 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-04-06 18:51:11,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 18:51:11,874 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 1 times [2022-04-06 18:51:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478100136] [2022-04-06 18:51:11,875 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 2 times [2022-04-06 18:51:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:11,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178784934] [2022-04-06 18:51:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-06 18:51:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178784934] [2022-04-06 18:51:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178784934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478100136] [2022-04-06 18:51:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478100136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:11,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:11,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621263195] [2022-04-06 18:51:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:11,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:11,968 INFO L87 Difference]: Start difference. First operand 1348 states and 1891 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-04-06 18:51:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:12,235 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-04-06 18:51:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 221 [2022-04-06 18:51:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:12,241 INFO L225 Difference]: With dead ends: 2803 [2022-04-06 18:51:12,242 INFO L226 Difference]: Without dead ends: 1468 [2022-04-06 18:51:12,244 INFO L912 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-04-06 18:51:12,245 INFO L913 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-04-06 18:51:12,245 INFO L914 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-04-06 18:51:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-04-06 18:51:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-04-06 18:51:12,330 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-04-06 18:51:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-04-06 18:51:12,335 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 221 [2022-04-06 18:51:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:12,335 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-04-06 18:51:12,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-04-06 18:51:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-04-06 18:51:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-06 18:51:12,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:12,339 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2022-04-06 18:51:12,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 18:51:12,340 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:12,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 1 times [2022-04-06 18:51:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:12,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251252910] [2022-04-06 18:51:12,341 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:12,341 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 2 times [2022-04-06 18:51:12,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:12,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089147252] [2022-04-06 18:51:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-06 18:51:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089147252] [2022-04-06 18:51:12,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089147252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:12,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:12,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:12,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251252910] [2022-04-06 18:51:12,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251252910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:12,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:12,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723663550] [2022-04-06 18:51:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:12,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:12,418 INFO L87 Difference]: Start difference. First operand 1460 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-04-06 18:51:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:12,702 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-04-06 18:51:12,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:12,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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 221 [2022-04-06 18:51:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:12,709 INFO L225 Difference]: With dead ends: 3043 [2022-04-06 18:51:12,709 INFO L226 Difference]: Without dead ends: 1596 [2022-04-06 18:51:12,712 INFO L912 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-04-06 18:51:12,713 INFO L913 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-04-06 18:51:12,713 INFO L914 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-04-06 18:51:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-04-06 18:51:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-04-06 18:51:12,801 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-04-06 18:51:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-04-06 18:51:12,805 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 221 [2022-04-06 18:51:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:12,805 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-04-06 18:51:12,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-04-06 18:51:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-04-06 18:51:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-04-06 18:51:12,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:12,810 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:12,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 18:51:12,811 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 1 times [2022-04-06 18:51:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:12,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671662038] [2022-04-06 18:51:12,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 2 times [2022-04-06 18:51:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:12,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112093622] [2022-04-06 18:51:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-04-06 18:51:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:12,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112093622] [2022-04-06 18:51:12,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112093622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:12,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:12,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:12,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:12,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671662038] [2022-04-06 18:51:12,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671662038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:12,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:12,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135963733] [2022-04-06 18:51:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:12,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:12,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:12,873 INFO L87 Difference]: Start difference. First operand 1584 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-04-06 18:51:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:13,203 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-04-06 18:51:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 251 [2022-04-06 18:51:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:13,217 INFO L225 Difference]: With dead ends: 4722 [2022-04-06 18:51:13,217 INFO L226 Difference]: Without dead ends: 3151 [2022-04-06 18:51:13,222 INFO L912 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-04-06 18:51:13,222 INFO L913 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-04-06 18:51:13,223 INFO L914 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-04-06 18:51:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-04-06 18:51:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-04-06 18:51:13,433 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-04-06 18:51:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-04-06 18:51:13,442 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 251 [2022-04-06 18:51:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:13,443 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-04-06 18:51:13,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-04-06 18:51:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-04-06 18:51:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-04-06 18:51:13,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:13,450 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:13,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 18:51:13,451 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 1 times [2022-04-06 18:51:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072561966] [2022-04-06 18:51:13,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 2 times [2022-04-06 18:51:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:13,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172061993] [2022-04-06 18:51:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-06 18:51:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:13,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172061993] [2022-04-06 18:51:13,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172061993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:13,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:13,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:13,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:13,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072561966] [2022-04-06 18:51:13,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072561966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:13,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:13,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956026870] [2022-04-06 18:51:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:13,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:13,514 INFO L87 Difference]: Start difference. First operand 3149 states and 4308 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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-04-06 18:51:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:13,911 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-04-06 18:51:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:13,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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 251 [2022-04-06 18:51:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:13,925 INFO L225 Difference]: With dead ends: 6585 [2022-04-06 18:51:13,925 INFO L226 Difference]: Without dead ends: 3449 [2022-04-06 18:51:13,931 INFO L912 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-04-06 18:51:13,933 INFO L913 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-04-06 18:51:13,933 INFO L914 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-04-06 18:51:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-04-06 18:51:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-04-06 18:51:14,158 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-04-06 18:51:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-04-06 18:51:14,173 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 251 [2022-04-06 18:51:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:14,174 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-04-06 18:51:14,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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-04-06 18:51:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-04-06 18:51:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-06 18:51:14,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:14,183 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:14,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 18:51:14,183 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 1 times [2022-04-06 18:51:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730184361] [2022-04-06 18:51:14,186 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 2 times [2022-04-06 18:51:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:14,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976997020] [2022-04-06 18:51:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-04-06 18:51:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976997020] [2022-04-06 18:51:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976997020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:14,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:14,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:14,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730184361] [2022-04-06 18:51:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730184361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:14,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:14,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728340399] [2022-04-06 18:51:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:14,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:14,257 INFO L87 Difference]: Start difference. First operand 3433 states and 4632 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-04-06 18:51:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:14,631 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-04-06 18:51:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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 275 [2022-04-06 18:51:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:14,645 INFO L225 Difference]: With dead ends: 7001 [2022-04-06 18:51:14,646 INFO L226 Difference]: Without dead ends: 3581 [2022-04-06 18:51:14,654 INFO L912 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-04-06 18:51:14,655 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-04-06 18:51:14,655 INFO L914 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-04-06 18:51:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-04-06 18:51:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-04-06 18:51:14,874 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-04-06 18:51:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-04-06 18:51:14,883 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 275 [2022-04-06 18:51:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:14,883 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-04-06 18:51:14,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 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-04-06 18:51:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-04-06 18:51:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-04-06 18:51:14,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:14,892 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:14,892 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 18:51:14,892 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 1 times [2022-04-06 18:51:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:14,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197784197] [2022-04-06 18:51:14,894 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 2 times [2022-04-06 18:51:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:14,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690008456] [2022-04-06 18:51:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:14,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-04-06 18:51:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690008456] [2022-04-06 18:51:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690008456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:14,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197784197] [2022-04-06 18:51:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197784197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369967124] [2022-04-06 18:51:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:14,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:14,953 INFO L87 Difference]: Start difference. First operand 3565 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-04-06 18:51:15,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:15,354 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-04-06 18:51:15,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:15,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 286 [2022-04-06 18:51:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:15,377 INFO L225 Difference]: With dead ends: 7517 [2022-04-06 18:51:15,377 INFO L226 Difference]: Without dead ends: 3965 [2022-04-06 18:51:15,386 INFO L912 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-04-06 18:51:15,386 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 228 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 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-04-06 18:51:15,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-04-06 18:51:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-04-06 18:51:15,649 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-04-06 18:51:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-04-06 18:51:15,657 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 286 [2022-04-06 18:51:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:15,657 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-04-06 18:51:15,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-04-06 18:51:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-04-06 18:51:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-04-06 18:51:15,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:15,668 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:15,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 18:51:15,668 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:15,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:15,669 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 1 times [2022-04-06 18:51:15,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:15,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393956389] [2022-04-06 18:51:15,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 2 times [2022-04-06 18:51:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:15,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473623661] [2022-04-06 18:51:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-04-06 18:51:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473623661] [2022-04-06 18:51:15,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473623661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:15,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:15,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:15,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:15,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393956389] [2022-04-06 18:51:15,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393956389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:15,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:15,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408350650] [2022-04-06 18:51:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:15,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:15,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:15,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:15,731 INFO L87 Difference]: Start difference. First operand 3877 states and 5152 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-04-06 18:51:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:16,120 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-04-06 18:51:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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 300 [2022-04-06 18:51:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:16,131 INFO L225 Difference]: With dead ends: 8149 [2022-04-06 18:51:16,132 INFO L226 Difference]: Without dead ends: 4285 [2022-04-06 18:51:16,139 INFO L912 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-04-06 18:51:16,140 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:16,140 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 192 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-04-06 18:51:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-04-06 18:51:16,406 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-04-06 18:51:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-04-06 18:51:16,415 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 300 [2022-04-06 18:51:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:16,415 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-04-06 18:51:16,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 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-04-06 18:51:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-04-06 18:51:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-04-06 18:51:16,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:16,424 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:16,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 18:51:16,424 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 1 times [2022-04-06 18:51:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:16,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914814401] [2022-04-06 18:51:16,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 2 times [2022-04-06 18:51:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:16,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221594624] [2022-04-06 18:51:16,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:16,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2022-04-06 18:51:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:16,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221594624] [2022-04-06 18:51:16,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221594624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:16,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914814401] [2022-04-06 18:51:16,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914814401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518527520] [2022-04-06 18:51:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:16,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:16,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:16,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:16,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:16,507 INFO L87 Difference]: Start difference. First operand 3997 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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-04-06 18:51:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:17,058 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-04-06 18:51:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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 301 [2022-04-06 18:51:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:17,077 INFO L225 Difference]: With dead ends: 11461 [2022-04-06 18:51:17,077 INFO L226 Difference]: Without dead ends: 7477 [2022-04-06 18:51:17,090 INFO L912 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-04-06 18:51:17,091 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 260 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 325 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-04-06 18:51:17,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 325 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-04-06 18:51:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-04-06 18:51:17,589 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-04-06 18:51:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-04-06 18:51:17,606 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 301 [2022-04-06 18:51:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:17,607 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-04-06 18:51:17,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 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-04-06 18:51:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-04-06 18:51:17,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-04-06 18:51:17,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:17,648 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:17,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-06 18:51:17,649 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:17,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 1 times [2022-04-06 18:51:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:17,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920481556] [2022-04-06 18:51:17,651 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 2 times [2022-04-06 18:51:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:17,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29501225] [2022-04-06 18:51:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:17,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-04-06 18:51:17,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:17,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29501225] [2022-04-06 18:51:17,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29501225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:17,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:17,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:17,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:17,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920481556] [2022-04-06 18:51:17,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920481556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:17,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119309905] [2022-04-06 18:51:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:17,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:17,726 INFO L87 Difference]: Start difference. First operand 7475 states and 9958 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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-04-06 18:51:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:18,271 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-04-06 18:51:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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 302 [2022-04-06 18:51:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:18,291 INFO L225 Difference]: With dead ends: 14945 [2022-04-06 18:51:18,292 INFO L226 Difference]: Without dead ends: 7483 [2022-04-06 18:51:18,306 INFO L912 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-04-06 18:51:18,307 INFO L913 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-04-06 18:51:18,307 INFO L914 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-04-06 18:51:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-04-06 18:51:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-04-06 18:51:18,751 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-04-06 18:51:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-04-06 18:51:18,769 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 302 [2022-04-06 18:51:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:18,770 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-04-06 18:51:18,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 3 states have internal predecessors, (157), 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-04-06 18:51:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-04-06 18:51:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-04-06 18:51:18,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:18,787 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:18,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-06 18:51:18,787 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 1 times [2022-04-06 18:51:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:18,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699960122] [2022-04-06 18:51:18,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 2 times [2022-04-06 18:51:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:18,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910447980] [2022-04-06 18:51:18,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:18,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-04-06 18:51:18,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910447980] [2022-04-06 18:51:18,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910447980] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:51:18,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394847683] [2022-04-06 18:51:18,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:51:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:51:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:18,907 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-04-06 18:51:18,933 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-04-06 18:51:19,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:51:19,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:51:19,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 18:51:19,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:51:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2022-04-06 18:51:19,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 18:51:19,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394847683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:19,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 18:51:19,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-06 18:51:19,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:19,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699960122] [2022-04-06 18:51:19,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699960122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:19,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:19,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:51:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653401089] [2022-04-06 18:51:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:19,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:51:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:19,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:51:19,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-06 18:51:19,645 INFO L87 Difference]: Start difference. First operand 7451 states and 9678 transitions. Second operand has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-04-06 18:51:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:20,190 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-04-06 18:51:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 18:51:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 325 [2022-04-06 18:51:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:20,211 INFO L225 Difference]: With dead ends: 15067 [2022-04-06 18:51:20,211 INFO L226 Difference]: Without dead ends: 7601 [2022-04-06 18:51:20,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 324 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-04-06 18:51:20,229 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 249 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:20,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 382 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:51:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-04-06 18:51:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-04-06 18:51:20,716 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-04-06 18:51:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-04-06 18:51:20,731 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 325 [2022-04-06 18:51:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:20,732 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-04-06 18:51:20,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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-04-06 18:51:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-04-06 18:51:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-04-06 18:51:20,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:20,742 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:20,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 18:51:20,955 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-04-06 18:51:20,956 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 1 times [2022-04-06 18:51:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:20,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540499299] [2022-04-06 18:51:20,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 2 times [2022-04-06 18:51:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:20,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089685758] [2022-04-06 18:51:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-06 18:51:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089685758] [2022-04-06 18:51:21,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089685758] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:51:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642941147] [2022-04-06 18:51:21,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:51:21,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:51:21,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:21,043 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-04-06 18:51:21,068 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-04-06 18:51:21,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:51:21,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:51:21,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:51:21,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:51:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-06 18:51:21,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:51:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-04-06 18:51:22,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642941147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:51:22,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:51:22,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-06 18:51:22,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:22,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540499299] [2022-04-06 18:51:22,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540499299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:22,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:22,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:51:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357318572] [2022-04-06 18:51:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:22,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:51:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:22,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:51:22,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 18:51:22,212 INFO L87 Difference]: Start difference. First operand 7457 states and 9686 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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-04-06 18:51:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:23,266 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-04-06 18:51:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 18:51:23,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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 338 [2022-04-06 18:51:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:23,292 INFO L225 Difference]: With dead ends: 14825 [2022-04-06 18:51:23,293 INFO L226 Difference]: Without dead ends: 11185 [2022-04-06 18:51:23,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 679 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-04-06 18:51:23,307 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 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-04-06 18:51:23,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 18:51:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-04-06 18:51:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-04-06 18:51:24,086 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-04-06 18:51:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-04-06 18:51:24,105 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 338 [2022-04-06 18:51:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:24,106 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-04-06 18:51:24,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 4 states have internal predecessors, (179), 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-04-06 18:51:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-04-06 18:51:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-04-06 18:51:24,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:24,119 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:24,146 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-04-06 18:51:24,343 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-04-06 18:51:24,343 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 3 times [2022-04-06 18:51:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:24,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271701800] [2022-04-06 18:51:24,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 4 times [2022-04-06 18:51:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:24,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849545544] [2022-04-06 18:51:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-04-06 18:51:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849545544] [2022-04-06 18:51:24,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849545544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:51:24,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881813517] [2022-04-06 18:51:24,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 18:51:24,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:51:24,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:24,428 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-04-06 18:51:24,429 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-04-06 18:51:24,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 18:51:24,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:51:24,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:51:24,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:51:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2022-04-06 18:51:24,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 18:51:24,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881813517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:24,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 18:51:24,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-06 18:51:24,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:24,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271701800] [2022-04-06 18:51:24,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271701800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:24,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:24,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 18:51:24,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888495414] [2022-04-06 18:51:24,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:24,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 18:51:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:24,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 18:51:24,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:51:24,964 INFO L87 Difference]: Start difference. First operand 8561 states and 11182 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-04-06 18:51:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:25,462 INFO L93 Difference]: Finished difference Result 14704 states and 18910 transitions. [2022-04-06 18:51:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 18:51:25,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 351 [2022-04-06 18:51:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:25,472 INFO L225 Difference]: With dead ends: 14704 [2022-04-06 18:51:25,472 INFO L226 Difference]: Without dead ends: 6162 [2022-04-06 18:51:25,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 18:51:25,491 INFO L913 BasicCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:25,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 18:51:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-04-06 18:51:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 5972. [2022-04-06 18:51:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5972 states, 5967 states have (on average 1.2552371375900788) internal successors, (7490), 5967 states have internal predecessors, (7490), 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-04-06 18:51:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 7494 transitions. [2022-04-06 18:51:25,924 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 7494 transitions. Word has length 351 [2022-04-06 18:51:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:25,925 INFO L478 AbstractCegarLoop]: Abstraction has 5972 states and 7494 transitions. [2022-04-06 18:51:25,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-04-06 18:51:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 7494 transitions. [2022-04-06 18:51:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-04-06 18:51:25,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:25,932 INFO L499 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, 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] [2022-04-06 18:51:25,958 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-04-06 18:51:26,155 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-04-06 18:51:26,156 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 1 times [2022-04-06 18:51:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1081199915] [2022-04-06 18:51:26,158 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 2 times [2022-04-06 18:51:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:26,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767035813] [2022-04-06 18:51:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:51:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767035813] [2022-04-06 18:51:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767035813] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:51:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535306673] [2022-04-06 18:51:26,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:51:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:51:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:26,244 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-04-06 18:51:26,278 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-04-06 18:51:26,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:51:26,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:51:26,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:51:26,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:51:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:51:26,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:51:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-04-06 18:51:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535306673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:51:27,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:51:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-06 18:51:27,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:27,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1081199915] [2022-04-06 18:51:27,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1081199915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:27,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:27,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:51:27,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989832124] [2022-04-06 18:51:27,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:27,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:51:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:51:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 18:51:27,237 INFO L87 Difference]: Start difference. First operand 5972 states and 7494 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 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-04-06 18:51:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:28,044 INFO L93 Difference]: Finished difference Result 12972 states and 16213 transitions. [2022-04-06 18:51:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 18:51:28,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 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 382 [2022-04-06 18:51:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:28,056 INFO L225 Difference]: With dead ends: 12972 [2022-04-06 18:51:28,056 INFO L226 Difference]: Without dead ends: 7040 [2022-04-06 18:51:28,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 766 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-04-06 18:51:28,068 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 457 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:28,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 228 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 18:51:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2022-04-06 18:51:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 6098. [2022-04-06 18:51:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6098 states, 6093 states have (on average 1.247497127851633) internal successors, (7601), 6093 states have internal predecessors, (7601), 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-04-06 18:51:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 7605 transitions. [2022-04-06 18:51:28,558 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 7605 transitions. Word has length 382 [2022-04-06 18:51:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:28,559 INFO L478 AbstractCegarLoop]: Abstraction has 6098 states and 7605 transitions. [2022-04-06 18:51:28,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 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-04-06 18:51:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 7605 transitions. [2022-04-06 18:51:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-04-06 18:51:28,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:28,567 INFO L499 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, 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-04-06 18:51:28,594 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-04-06 18:51:28,791 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,SelfDestructingSolverStorable25 [2022-04-06 18:51:28,792 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 1 times [2022-04-06 18:51:28,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:28,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128957065] [2022-04-06 18:51:28,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 2 times [2022-04-06 18:51:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765479490] [2022-04-06 18:51:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-04-06 18:51:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:28,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765479490] [2022-04-06 18:51:28,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765479490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:28,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:28,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:28,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:28,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128957065] [2022-04-06 18:51:28,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128957065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:28,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 18:51:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320091867] [2022-04-06 18:51:28,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:28,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 18:51:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 18:51:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 18:51:28,882 INFO L87 Difference]: Start difference. First operand 6098 states and 7605 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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-04-06 18:51:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:29,415 INFO L93 Difference]: Finished difference Result 11742 states and 14397 transitions. [2022-04-06 18:51:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 18:51:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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 421 [2022-04-06 18:51:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:29,419 INFO L225 Difference]: With dead ends: 11742 [2022-04-06 18:51:29,419 INFO L226 Difference]: Without dead ends: 2973 [2022-04-06 18:51:29,426 INFO L912 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-04-06 18:51:29,426 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:29,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 192 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-04-06 18:51:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2807. [2022-04-06 18:51:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2807 states, 2802 states have (on average 1.2373304782298358) internal successors, (3467), 2802 states have internal predecessors, (3467), 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-04-06 18:51:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3471 transitions. [2022-04-06 18:51:29,629 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3471 transitions. Word has length 421 [2022-04-06 18:51:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:29,630 INFO L478 AbstractCegarLoop]: Abstraction has 2807 states and 3471 transitions. [2022-04-06 18:51:29,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 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-04-06 18:51:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3471 transitions. [2022-04-06 18:51:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-04-06 18:51:29,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 18:51:29,635 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04-06 18:51:29,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-06 18:51:29,635 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 18:51:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 18:51:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 1 times [2022-04-06 18:51:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:29,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636248706] [2022-04-06 18:51:29,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 18:51:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 2 times [2022-04-06 18:51:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 18:51:29,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742944076] [2022-04-06 18:51:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 18:51:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 18:51:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 18:51:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 18:51:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-06 18:51:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 18:51:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742944076] [2022-04-06 18:51:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742944076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 18:51:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658710883] [2022-04-06 18:51:29,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 18:51:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 18:51:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 18:51:29,722 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-04-06 18:51:29,747 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-04-06 18:51:29,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 18:51:29,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 18:51:29,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 18:51:29,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 18:51:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-06 18:51:30,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 18:51:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-04-06 18:51:30,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658710883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 18:51:30,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 18:51:30,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-06 18:51:30,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 18:51:30,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636248706] [2022-04-06 18:51:30,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636248706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 18:51:30,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 18:51:30,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 18:51:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064265812] [2022-04-06 18:51:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 18:51:30,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 18:51:30,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 18:51:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 18:51:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-06 18:51:30,997 INFO L87 Difference]: Start difference. First operand 2807 states and 3471 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 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-04-06 18:51:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 18:51:31,264 INFO L93 Difference]: Finished difference Result 3042 states and 3766 transitions. [2022-04-06 18:51:31,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 18:51:31,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 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 488 [2022-04-06 18:51:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 18:51:31,265 INFO L225 Difference]: With dead ends: 3042 [2022-04-06 18:51:31,265 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 18:51:31,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 976 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-04-06 18:51:31,271 INFO L913 BasicCegarLoop]: 166 mSDtfsCounter, 151 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 18:51:31,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 178 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 18:51:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 18:51:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 18:51:31,272 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-04-06 18:51:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 18:51:31,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 488 [2022-04-06 18:51:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 18:51:31,273 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 18:51:31,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 4 states have internal predecessors, (211), 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-04-06 18:51:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 18:51:31,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 18:51:31,275 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 18:51:31,303 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-04-06 18:51:31,491 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-04-06 18:51:31,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 18:52:17,796 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-06 18:52:17,796 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-06 18:52:17,796 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-06 18:52:17,796 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-04-06 18:52:17,796 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-04-06 18:52:17,797 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-04-06 18:52:17,797 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-04-06 18:52:17,797 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-04-06 18:52:17,797 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,797 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-04-06 18:52:17,797 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,797 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_~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-04-06 18:52:17,797 INFO L878 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-06 18:52:17,797 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_~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-04-06 18:52:17,797 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-04-06 18:52:17,797 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-04-06 18:52:17,798 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 548) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,798 INFO L878 garLoopResultBuilder]: At program point L301(lines 301 303) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-06 18:52:17,798 INFO L878 garLoopResultBuilder]: At program point L301-2(lines 296 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) (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-04-06 18:52:17,798 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 547) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,798 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,798 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,799 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-04-06 18:52:17,799 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 (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse1 .cse2 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 4432 ssl3_connect_~s__state~0) .cse1) (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-04-06 18:52:17,799 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 512) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-06 18:52:17,799 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 523) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-06 18:52:17,799 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-04-06 18:52:17,799 INFO L878 garLoopResultBuilder]: At program point L534(lines 534 539) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,800 INFO L878 garLoopResultBuilder]: At program point L534-2(lines 533 547) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,800 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 272) 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-04-06 18:52:17,800 INFO L878 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,800 INFO L878 garLoopResultBuilder]: At program point L138(lines 134 524) 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-04-06 18:52:17,800 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-04-06 18:52:17,800 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 538) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,801 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 500) the Hoare annotation is: (let ((.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)) (.cse1 (= 2 ssl3_connect_~blastFlag~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 .cse3 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2022-04-06 18:52:17,801 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 511) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-06 18:52:17,801 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 522) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-06 18:52:17,801 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,801 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)) (.cse3 (= 4496 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse1 .cse3 .cse4) (and .cse1 .cse2 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,801 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-04-06 18:52:17,802 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))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,802 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,802 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-04-06 18:52:17,802 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-04-06 18:52:17,802 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 510) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-06 18:52:17,802 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 521) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-06 18:52:17,802 INFO L878 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,803 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_~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-04-06 18:52:17,803 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-04-06 18:52:17,803 INFO L878 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-06 18:52:17,803 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,803 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,803 INFO L878 garLoopResultBuilder]: At program point L277(lines 277 279) 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-04-06 18:52:17,803 INFO L878 garLoopResultBuilder]: At program point L277-2(lines 213 496) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= 2 ssl3_connect_~blastFlag~0))) [2022-04-06 18:52:17,804 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 445) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,804 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,804 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-04-06 18:52:17,804 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 509) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse10 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse9) (and .cse0 .cse10 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse10) (and .cse11 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse11 .cse3 .cse9) (and .cse11 .cse1))) [2022-04-06 18:52:17,804 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 520) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and .cse15 .cse4))) [2022-04-06 18:52:17,804 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 531) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,804 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,805 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-04-06 18:52:17,805 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-04-06 18:52:17,805 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-04-06 18:52:17,805 INFO L878 garLoopResultBuilder]: At program point L446(lines 446 450) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,805 INFO L878 garLoopResultBuilder]: At program point L446-2(lines 446 450) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 (= 4512 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2))) [2022-04-06 18:52:17,805 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,805 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_~s__s3__tmp__cert_req~0 0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse5 (= ssl3_connect_~s__state~0 4480)) (.cse3 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse5) (and .cse4 .cse1 .cse5 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,805 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 508) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse10 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse9) (and .cse0 .cse10 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse10) (and .cse11 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse11 .cse3 .cse9) (and .cse11 .cse1))) [2022-04-06 18:52:17,806 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 519) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-06 18:52:17,806 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 530) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,806 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) (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-04-06 18:52:17,806 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-04-06 18:52:17,806 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) (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-04-06 18:52:17,806 INFO L878 garLoopResultBuilder]: At program point L283(lines 283 287) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= 2 ssl3_connect_~blastFlag~0))) [2022-04-06 18:52:17,806 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-04-06 18:52:17,806 INFO L878 garLoopResultBuilder]: At program point L316-2(lines 213 496) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4))) [2022-04-06 18:52:17,806 INFO L878 garLoopResultBuilder]: At program point L283-2(lines 283 287) the Hoare annotation is: (let ((.cse0 (= 2 ssl3_connect_~blastFlag~0))) (or (and (<= 4560 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse0 (= ssl3_connect_~s__hit~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,807 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,807 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,807 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-04-06 18:52:17,807 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 507) the Hoare annotation is: (let ((.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse10 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse1 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse7) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse5 .cse6 .cse1) (and .cse0 .cse8 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse8) (and .cse10 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse7) (and .cse10 .cse3 .cse9) (and .cse10 .cse1))) [2022-04-06 18:52:17,807 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 518) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-06 18:52:17,807 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 529) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,808 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,808 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-04-06 18:52:17,808 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-04-06 18:52:17,808 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-04-06 18:52:17,808 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 506) the Hoare annotation is: (let ((.cse5 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse9 (<= ssl3_connect_~blastFlag~0 4)) (.cse10 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse1 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse7) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse5 .cse6 .cse1) (and .cse0 .cse8 .cse1 .cse3) (and .cse3 .cse4 .cse9) (and .cse2 .cse8) (and .cse10 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse7) (and .cse10 .cse3 .cse9) (and .cse10 .cse1))) [2022-04-06 18:52:17,808 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 517) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-06 18:52:17,808 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 528) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,809 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:52:17,809 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-04-06 18:52:17,809 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-04-06 18:52:17,809 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 505) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse8 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (and .cse8 .cse3 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6) (and .cse8 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse8 .cse1))) [2022-04-06 18:52:17,809 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 516) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse5 .cse0 .cse12) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse13 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse13) (and .cse14 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse0 .cse12 .cse2) (and .cse14 .cse0 .cse2) (and .cse14 .cse4))) [2022-04-06 18:52:17,809 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 527) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse16 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse15 .cse16 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse15 .cse16 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse17 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse17 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse4))) [2022-04-06 18:52:17,809 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-04-06 18:52:17,809 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-04-06 18:52:17,810 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))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,810 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 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-04-06 18:52:17,810 INFO L878 garLoopResultBuilder]: At program point L423-1(lines 423 437) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 .cse2 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 (= 3 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,810 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))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,810 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 327) the Hoare annotation is: (or (and (= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:52:17,810 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,810 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-04-06 18:52:17,810 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-04-06 18:52:17,810 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-04-06 18:52:17,810 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,810 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 504) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse8 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (and .cse8 .cse3 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6) (and .cse8 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse8 .cse1))) [2022-04-06 18:52:17,811 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 515) the Hoare annotation is: (let ((.cse6 (= ssl3_connect_~s__state~0 4464)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse2 .cse3 .cse6) (and .cse1 .cse4) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse3 .cse10) (and .cse3 .cse6 .cse11) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse3 .cse5 .cse11) (and .cse0 .cse12 .cse1 .cse3) (and .cse3 .cse4 .cse11) (and .cse2 .cse12) (and .cse13 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse9) (and .cse3 .cse10 .cse11) (and .cse13 .cse3 .cse11) (and .cse13 .cse1))) [2022-04-06 18:52:17,811 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 526) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~blastFlag~0 0)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) .cse14) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse15 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse15) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) .cse14) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,811 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,811 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 308) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-06 18:52:17,811 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-04-06 18:52:17,811 INFO L878 garLoopResultBuilder]: At program point L294-2(lines 294 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) (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-04-06 18:52:17,811 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,811 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-04-06 18:52:17,811 INFO L878 garLoopResultBuilder]: At program point L427(lines 427 433) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4352) (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 264) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0))) [2022-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point L262-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-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-04-06 18:52:17,812 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))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 503) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6))) [2022-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 514) the Hoare annotation is: (let ((.cse6 (= ssl3_connect_~s__state~0 4464)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse2 .cse3 .cse6) (and .cse1 .cse4) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse3 .cse10) (and .cse3 .cse6 .cse11) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse7 .cse8 .cse1) (and .cse3 .cse5 .cse11) (and .cse0 .cse12 .cse1 .cse3) (and .cse3 .cse4 .cse11) (and .cse2 .cse12) (and .cse13 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse9) (and .cse3 .cse10 .cse11) (and .cse13 .cse3 .cse11) (and .cse13 .cse1))) [2022-04-06 18:52:17,812 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 525) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse15 .cse4))) [2022-04-06 18:52:17,812 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)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0))) [2022-04-06 18:52:17,813 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-04-06 18:52:17,813 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-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 304) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= 2 ssl3_connect_~blastFlag~0) (= ssl3_connect_~s__hit~0 0))) [2022-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse14 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse3 (= 3 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse14 .cse15 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse7 .cse2) (and .cse14 .cse15 .cse5 .cse0 .cse11) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse3) (and .cse16 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse16 .cse0 .cse2) (and (= ssl3_connect_~s__state~0 4368) (= ssl3_connect_~blastFlag~0 0)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse16 .cse4))) [2022-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 334) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 502) the Hoare annotation is: (let ((.cse2 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__hit~0 0)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse2 .cse4 .cse1) (and .cse0 .cse7 .cse1 .cse5) (and .cse3 .cse7) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse3 .cse5 .cse6))) [2022-04-06 18:52:17,813 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 513) the Hoare annotation is: (let ((.cse6 (<= 4560 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4560)) (.cse5 (= 4496 ssl3_connect_~s__state~0)) (.cse4 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 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)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse1 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse2 .cse3 .cse4) (and .cse2 .cse3 .cse5) (and .cse1 .cse4) (and .cse6 .cse2 .cse7 .cse3 .cse8) (and .cse2 .cse3 .cse9) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and .cse6 .cse7 .cse1) (and .cse3 .cse5 .cse10) (and .cse0 .cse11 .cse1 .cse3) (and .cse3 .cse4 .cse10) (and .cse2 .cse11) (and .cse12 .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse2 .cse3 .cse8) (and .cse3 .cse9 .cse10) (and .cse12 .cse3 .cse10) (and .cse12 .cse1))) [2022-04-06 18:52:17,814 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 524) the Hoare annotation is: (let ((.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse9 (<= 4560 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4560)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse4 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse5 .cse0 .cse6) (and .cse5 .cse0 .cse7) (and .cse5 .cse0 .cse8) (and .cse4 .cse6) (and .cse9 .cse5 .cse10 .cse0 .cse11) (and .cse12 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse13) (and .cse0 .cse8 .cse2) (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (and (= 4432 ssl3_connect_~s__state~0) .cse0 .cse2) (and .cse9 .cse10 .cse4) (and .cse0 .cse7 .cse2) (and .cse3 .cse14 .cse4 .cse0) (and (= 4400 ssl3_connect_~s__state~0) .cse4 .cse0) (and .cse12 .cse4 .cse0) (and .cse0 .cse6 .cse2) (and .cse5 .cse14) (and .cse15 .cse5 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse5 .cse0 .cse11) (and .cse5 .cse0 .cse1) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse0) (and .cse0 .cse13 .cse2) (and .cse15 .cse0 .cse2) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse15 .cse4))) [2022-04-06 18:52:17,814 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,814 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,814 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,814 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 18:52:17,817 INFO L719 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-04-06 18:52:17,818 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 18:52:17,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:52:17 BoogieIcfgContainer [2022-04-06 18:52:17,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 18:52:17,836 INFO L158 Benchmark]: Toolchain (without parser) took 72224.98ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 176.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 18:52:17,836 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 18:52:17,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.19ms. Allocated memory is still 197.1MB. Free memory was 176.6MB in the beginning and 172.7MB in the end (delta: 3.9MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-06 18:52:17,837 INFO L158 Benchmark]: Boogie Preprocessor took 54.29ms. Allocated memory is still 197.1MB. Free memory was 172.7MB in the beginning and 170.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 18:52:17,837 INFO L158 Benchmark]: RCFGBuilder took 605.43ms. Allocated memory is still 197.1MB. Free memory was 170.4MB in the beginning and 144.8MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-04-06 18:52:17,837 INFO L158 Benchmark]: TraceAbstraction took 71250.71ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 144.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-04-06 18:52:17,838 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.12ms. Allocated memory is still 197.1MB. Free memory is still 167.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.19ms. Allocated memory is still 197.1MB. Free memory was 176.6MB in the beginning and 172.7MB in the end (delta: 3.9MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.29ms. Allocated memory is still 197.1MB. Free memory was 172.7MB in the beginning and 170.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 605.43ms. Allocated memory is still 197.1MB. Free memory was 170.4MB in the beginning and 144.8MB in the end (delta: 25.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 71250.71ms. Allocated memory was 197.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 144.2MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. 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: 71.2s, OverallIterations: 28, TraceHistogramMax: 18, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6756 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6754 mSDsluCounter, 6312 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5666 IncrementalHoareTripleChecker+Invalid, 6206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 5793 mSDtfsCounter, 5666 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3292 GetRequests, 3188 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8561occurred in iteration=24, 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.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 4666 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 3275 NumberOfFragments, 10540 HoareAnnotationTreeSize, 137 FomulaSimplifications, 67412 FormulaSimplificationTreeSizeReduction, 11.6s HoareSimplificationTime, 137 FomulaSimplificationsInter, 140763 FormulaSimplificationTreeSizeReductionInter, 34.6s 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: ((((((((((((((((((((((((((((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)) || (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)) || ((s__hit == 0 && s__state == 4464) && blastFlag <= 4)) || ((4432 == s__state && s__hit == 0) && blastFlag <= 4)) || ((4560 <= s__state && s__state <= 4560) && 2 == blastFlag)) || (((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && 3 == s__s3__tmp__next_state___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)) || (s__state == 4368 && blastFlag == 0)) || (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) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (s__state == 4368 && blastFlag == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((4352 <= s__state && 3 == blastFlag) && s__state <= 4560) && s__hit == 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) && 3 == s__s3__tmp__next_state___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) || !(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__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || ((4560 <= s__state && s__state <= 4560) && 2 == blastFlag)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((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) || !(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) || !(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) || !(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)) || !(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)) || !(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) || !(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-04-06 18:52:17,874 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...