/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 13:15:37,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 13:15:37,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 13:15:37,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 13:15:37,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 13:15:37,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 13:15:37,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 13:15:37,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 13:15:37,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 13:15:37,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 13:15:37,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 13:15:37,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 13:15:37,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 13:15:37,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 13:15:37,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 13:15:37,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 13:15:37,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 13:15:37,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 13:15:37,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 13:15:37,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 13:15:37,299 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 13:15:37,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 13:15:37,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 13:15:37,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 13:15:37,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 13:15:37,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 13:15:37,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 13:15:37,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 13:15:37,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 13:15:37,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 13:15:37,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 13:15:37,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 13:15:37,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 13:15:37,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 13:15:37,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 13:15:37,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 13:15:37,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 13:15:37,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 13:15:37,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 13:15:37,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 13:15:37,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 13:15:37,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 13:15:37,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-19 13:15:37,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 13:15:37,327 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 13:15:37,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 13:15:37,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 13:15:37,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 13:15:37,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 13:15:37,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 13:15:37,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 13:15:37,330 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 13:15:37,331 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 13:15:37,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 13:15:37,331 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-19 13:15:37,331 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 13:15:37,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 13:15:37,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 13:15:37,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 13:15:37,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 13:15:37,581 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 13:15:37,582 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-03-19 13:15:37,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8892a8e9c/91091c88457946409e1859351b0d991f/FLAG781aca28f [2022-03-19 13:15:37,995 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 13:15:37,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_4.cil-1.c [2022-03-19 13:15:38,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8892a8e9c/91091c88457946409e1859351b0d991f/FLAG781aca28f [2022-03-19 13:15:38,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8892a8e9c/91091c88457946409e1859351b0d991f [2022-03-19 13:15:38,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 13:15:38,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 13:15:38,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 13:15:38,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 13:15:38,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 13:15:38,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0022be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38, skipping insertion in model container [2022-03-19 13:15:38,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 13:15:38,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 13:15:38,267 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-03-19 13:15:38,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 13:15:38,275 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 13:15:38,301 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-03-19 13:15:38,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 13:15:38,310 INFO L208 MainTranslator]: Completed translation [2022-03-19 13:15:38,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38 WrapperNode [2022-03-19 13:15:38,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 13:15:38,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 13:15:38,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 13:15:38,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 13:15:38,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 13:15:38,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 13:15:38,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 13:15:38,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 13:15:38,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (1/1) ... [2022-03-19 13:15:38,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 13:15:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:38,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 13:15:38,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-03-19 13:15:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 13:15:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 13:15:38,402 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 13:15:38,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 13:15:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 13:15:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 13:15:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 13:15:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 13:15:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 13:15:38,510 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 13:15:38,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 13:15:38,592 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-19 13:15:38,824 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-03-19 13:15:38,824 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-03-19 13:15:38,826 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 13:15:38,831 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 13:15:38,831 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 13:15:38,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:15:38 BoogieIcfgContainer [2022-03-19 13:15:38,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 13:15:38,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 13:15:38,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 13:15:38,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 13:15:38,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 01:15:38" (1/3) ... [2022-03-19 13:15:38,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd8993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:15:38, skipping insertion in model container [2022-03-19 13:15:38,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 01:15:38" (2/3) ... [2022-03-19 13:15:38,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34dd8993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 01:15:38, skipping insertion in model container [2022-03-19 13:15:38,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 01:15:38" (3/3) ... [2022-03-19 13:15:38,846 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2022-03-19 13:15:38,849 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 13:15:38,849 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 13:15:38,877 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 13:15:38,880 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 13:15:38,881 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 13:15:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 13:15:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-19 13:15:38,910 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:38,910 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:38,911 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-03-19 13:15:38,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:38,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1473033068] [2022-03-19 13:15:38,939 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-03-19 13:15:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:38,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091449203] [2022-03-19 13:15:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 13:15:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:39,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091449203] [2022-03-19 13:15:39,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091449203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:39,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:39,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:39,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1473033068] [2022-03-19 13:15:39,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1473033068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:39,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:39,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552505347] [2022-03-19 13:15:39,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:39,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:39,260 INFO L87 Difference]: Start difference. First operand has 137 states, 129 states have (on average 1.697674418604651) internal successors, (219), 130 states have internal predecessors, (219), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:39,571 INFO L93 Difference]: Finished difference Result 376 states and 631 transitions. [2022-03-19 13:15:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-03-19 13:15:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:39,580 INFO L225 Difference]: With dead ends: 376 [2022-03-19 13:15:39,580 INFO L226 Difference]: Without dead ends: 219 [2022-03-19 13:15:39,583 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:39,587 INFO L912 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.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:39,589 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 224 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-03-19 13:15:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-03-19 13:15:39,684 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-03-19 13:15:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-03-19 13:15:39,687 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2022-03-19 13:15:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:39,688 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-03-19 13:15:39,688 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-03-19 13:15:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-19 13:15:39,692 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:39,693 INFO L500 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:39,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 13:15:39,694 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 1 times [2022-03-19 13:15:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985526206] [2022-03-19 13:15:39,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -67654802, now seen corresponding path program 2 times [2022-03-19 13:15:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:39,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640734612] [2022-03-19 13:15:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 13:15:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:39,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640734612] [2022-03-19 13:15:39,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640734612] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:39,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:39,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:39,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:39,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985526206] [2022-03-19 13:15:39,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985526206] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:39,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:39,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355151057] [2022-03-19 13:15:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:39,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:39,876 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-03-19 13:15:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:40,106 INFO L93 Difference]: Finished difference Result 349 states and 522 transitions. [2022-03-19 13:15:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-03-19 13:15:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:40,112 INFO L225 Difference]: With dead ends: 349 [2022-03-19 13:15:40,114 INFO L226 Difference]: Without dead ends: 244 [2022-03-19 13:15:40,117 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:40,121 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:40,121 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-03-19 13:15:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 236. [2022-03-19 13:15:40,151 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-03-19 13:15:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 345 transitions. [2022-03-19 13:15:40,152 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 345 transitions. Word has length 44 [2022-03-19 13:15:40,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:40,153 INFO L478 AbstractCegarLoop]: Abstraction has 236 states and 345 transitions. [2022-03-19 13:15:40,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 345 transitions. [2022-03-19 13:15:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-19 13:15:40,158 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:40,159 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:40,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 13:15:40,159 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 1 times [2022-03-19 13:15:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300173069] [2022-03-19 13:15:40,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash 791020593, now seen corresponding path program 2 times [2022-03-19 13:15:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966866241] [2022-03-19 13:15:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 13:15:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966866241] [2022-03-19 13:15:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966866241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:40,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300173069] [2022-03-19 13:15:40,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300173069] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030884905] [2022-03-19 13:15:40,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:40,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:40,268 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-03-19 13:15:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:40,503 INFO L93 Difference]: Finished difference Result 561 states and 851 transitions. [2022-03-19 13:15:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-03-19 13:15:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:40,505 INFO L225 Difference]: With dead ends: 561 [2022-03-19 13:15:40,505 INFO L226 Difference]: Without dead ends: 336 [2022-03-19 13:15:40,507 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:40,510 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:40,514 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 204 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-03-19 13:15:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 318. [2022-03-19 13:15:40,537 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-03-19 13:15:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2022-03-19 13:15:40,539 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 61 [2022-03-19 13:15:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:40,539 INFO L478 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2022-03-19 13:15:40,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:40,539 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2022-03-19 13:15:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-19 13:15:40,540 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:40,540 INFO L500 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:40,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 13:15:40,540 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:40,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 1 times [2022-03-19 13:15:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1329012065] [2022-03-19 13:15:40,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:40,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1014417741, now seen corresponding path program 2 times [2022-03-19 13:15:40,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:40,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58190663] [2022-03-19 13:15:40,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:40,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 13:15:40,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58190663] [2022-03-19 13:15:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58190663] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1329012065] [2022-03-19 13:15:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1329012065] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233490637] [2022-03-19 13:15:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:40,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:40,617 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-03-19 13:15:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:40,784 INFO L93 Difference]: Finished difference Result 673 states and 957 transitions. [2022-03-19 13:15:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:40,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-03-19 13:15:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:40,787 INFO L225 Difference]: With dead ends: 673 [2022-03-19 13:15:40,787 INFO L226 Difference]: Without dead ends: 368 [2022-03-19 13:15:40,788 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:40,791 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:40,791 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-03-19 13:15:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2022-03-19 13:15:40,809 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-03-19 13:15:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 493 transitions. [2022-03-19 13:15:40,810 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 493 transitions. Word has length 61 [2022-03-19 13:15:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:40,810 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 493 transitions. [2022-03-19 13:15:40,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 493 transitions. [2022-03-19 13:15:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-19 13:15:40,811 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:40,811 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:40,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 13:15:40,812 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 1 times [2022-03-19 13:15:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1563323990] [2022-03-19 13:15:40,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:40,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2014829456, now seen corresponding path program 2 times [2022-03-19 13:15:40,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:40,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972234983] [2022-03-19 13:15:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-19 13:15:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:40,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972234983] [2022-03-19 13:15:40,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972234983] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,849 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:40,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1563323990] [2022-03-19 13:15:40,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1563323990] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:40,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:40,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174987207] [2022-03-19 13:15:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:40,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:40,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:40,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:40,851 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-03-19 13:15:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:41,007 INFO L93 Difference]: Finished difference Result 805 states and 1153 transitions. [2022-03-19 13:15:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:41,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-03-19 13:15:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:41,010 INFO L225 Difference]: With dead ends: 805 [2022-03-19 13:15:41,010 INFO L226 Difference]: Without dead ends: 460 [2022-03-19 13:15:41,011 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:41,011 INFO L912 BasicCegarLoop]: 174 mSDtfsCounter, 295 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:41,013 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 181 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-03-19 13:15:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 434. [2022-03-19 13:15:41,050 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-03-19 13:15:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 627 transitions. [2022-03-19 13:15:41,051 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 627 transitions. Word has length 74 [2022-03-19 13:15:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:41,052 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 627 transitions. [2022-03-19 13:15:41,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 627 transitions. [2022-03-19 13:15:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-19 13:15:41,053 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:41,053 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:41,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 13:15:41,053 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:41,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:41,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 1 times [2022-03-19 13:15:41,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898648039] [2022-03-19 13:15:41,054 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1130395829, now seen corresponding path program 2 times [2022-03-19 13:15:41,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:41,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243290190] [2022-03-19 13:15:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:41,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-19 13:15:41,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:41,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243290190] [2022-03-19 13:15:41,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243290190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:41,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898648039] [2022-03-19 13:15:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898648039] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204672616] [2022-03-19 13:15:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:41,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:41,122 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-03-19 13:15:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:41,292 INFO L93 Difference]: Finished difference Result 903 states and 1314 transitions. [2022-03-19 13:15:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:41,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-03-19 13:15:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:41,294 INFO L225 Difference]: With dead ends: 903 [2022-03-19 13:15:41,294 INFO L226 Difference]: Without dead ends: 482 [2022-03-19 13:15:41,294 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:41,295 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:41,295 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 193 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-03-19 13:15:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 476. [2022-03-19 13:15:41,314 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-03-19 13:15:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 679 transitions. [2022-03-19 13:15:41,316 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 679 transitions. Word has length 78 [2022-03-19 13:15:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:41,316 INFO L478 AbstractCegarLoop]: Abstraction has 476 states and 679 transitions. [2022-03-19 13:15:41,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 679 transitions. [2022-03-19 13:15:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-19 13:15:41,317 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:41,317 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:41,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 13:15:41,318 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 1 times [2022-03-19 13:15:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825945093] [2022-03-19 13:15:41,319 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1894097131, now seen corresponding path program 2 times [2022-03-19 13:15:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:41,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642602740] [2022-03-19 13:15:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-19 13:15:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642602740] [2022-03-19 13:15:41,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642602740] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825945093] [2022-03-19 13:15:41,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825945093] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675358735] [2022-03-19 13:15:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:41,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:41,359 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-03-19 13:15:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:41,518 INFO L93 Difference]: Finished difference Result 956 states and 1369 transitions. [2022-03-19 13:15:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-03-19 13:15:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:41,520 INFO L225 Difference]: With dead ends: 956 [2022-03-19 13:15:41,520 INFO L226 Difference]: Without dead ends: 714 [2022-03-19 13:15:41,521 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:41,521 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:41,522 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 324 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-03-19 13:15:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-03-19 13:15:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 709 states have (on average 1.4287729196050776) internal successors, (1013), 709 states have internal predecessors, (1013), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-03-19 13:15:41,566 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-03-19 13:15:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:41,567 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-03-19 13:15:41,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-03-19 13:15:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-19 13:15:41,568 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:41,568 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:41,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 13:15:41,568 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 1 times [2022-03-19 13:15:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252715317] [2022-03-19 13:15:41,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1721597911, now seen corresponding path program 2 times [2022-03-19 13:15:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:41,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263823498] [2022-03-19 13:15:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-03-19 13:15:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:41,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263823498] [2022-03-19 13:15:41,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263823498] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:41,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252715317] [2022-03-19 13:15:41,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252715317] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671983292] [2022-03-19 13:15:41,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:41,598 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:41,599 INFO L87 Difference]: Start difference. First operand 714 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:41,752 INFO L93 Difference]: Finished difference Result 1215 states and 1730 transitions. [2022-03-19 13:15:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:41,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-03-19 13:15:41,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:41,755 INFO L225 Difference]: With dead ends: 1215 [2022-03-19 13:15:41,755 INFO L226 Difference]: Without dead ends: 735 [2022-03-19 13:15:41,756 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:41,756 INFO L912 BasicCegarLoop]: 197 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:41,756 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 204 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-03-19 13:15:41,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-03-19 13:15:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 730 states have (on average 1.4246575342465753) internal successors, (1040), 730 states have internal predecessors, (1040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-03-19 13:15:41,785 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-03-19 13:15:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:41,785 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-03-19 13:15:41,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-03-19 13:15:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-19 13:15:41,787 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:41,787 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:41,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 13:15:41,787 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:41,787 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 1 times [2022-03-19 13:15:41,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1958658986] [2022-03-19 13:15:41,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -255266854, now seen corresponding path program 2 times [2022-03-19 13:15:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:41,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052769948] [2022-03-19 13:15:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:41,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-19 13:15:41,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:41,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052769948] [2022-03-19 13:15:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052769948] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:41,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1958658986] [2022-03-19 13:15:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1958658986] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:41,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:41,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:41,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396434098] [2022-03-19 13:15:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:41,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:41,821 INFO L87 Difference]: Start difference. First operand 735 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:41,988 INFO L93 Difference]: Finished difference Result 1261 states and 1787 transitions. [2022-03-19 13:15:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-03-19 13:15:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:41,991 INFO L225 Difference]: With dead ends: 1261 [2022-03-19 13:15:41,991 INFO L226 Difference]: Without dead ends: 760 [2022-03-19 13:15:41,992 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:41,994 INFO L912 BasicCegarLoop]: 203 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:41,994 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-03-19 13:15:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-03-19 13:15:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 755 states have (on average 1.4172185430463575) internal successors, (1070), 755 states have internal predecessors, (1070), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-03-19 13:15:42,030 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-03-19 13:15:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:42,031 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-03-19 13:15:42,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-03-19 13:15:42,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-19 13:15:42,032 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:42,032 INFO L500 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:42,032 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 13:15:42,032 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 1 times [2022-03-19 13:15:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288086556] [2022-03-19 13:15:42,033 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash -121253348, now seen corresponding path program 2 times [2022-03-19 13:15:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:42,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266569020] [2022-03-19 13:15:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-03-19 13:15:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:42,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266569020] [2022-03-19 13:15:42,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266569020] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:42,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288086556] [2022-03-19 13:15:42,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288086556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084284518] [2022-03-19 13:15:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:42,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:42,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:42,080 INFO L87 Difference]: Start difference. First operand 760 states and 1074 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:42,255 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-03-19 13:15:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-03-19 13:15:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:42,259 INFO L225 Difference]: With dead ends: 1002 [2022-03-19 13:15:42,259 INFO L226 Difference]: Without dead ends: 1000 [2022-03-19 13:15:42,259 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:42,260 INFO L912 BasicCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:42,261 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 171 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-19 13:15:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-03-19 13:15:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 995 states have (on average 1.4221105527638191) internal successors, (1415), 995 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-03-19 13:15:42,304 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-03-19 13:15:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:42,304 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-03-19 13:15:42,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-03-19 13:15:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-03-19 13:15:42,308 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:42,308 INFO L500 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-03-19 13:15:42,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 13:15:42,308 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 1 times [2022-03-19 13:15:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [226873432] [2022-03-19 13:15:42,310 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash -976830099, now seen corresponding path program 2 times [2022-03-19 13:15:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:42,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842114192] [2022-03-19 13:15:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-03-19 13:15:42,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842114192] [2022-03-19 13:15:42,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842114192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:42,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [226873432] [2022-03-19 13:15:42,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [226873432] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126083616] [2022-03-19 13:15:42,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:42,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:42,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:42,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:42,363 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-03-19 13:15:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:42,577 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-03-19 13:15:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:42,577 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-03-19 13:15:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:42,581 INFO L225 Difference]: With dead ends: 2191 [2022-03-19 13:15:42,581 INFO L226 Difference]: Without dead ends: 1196 [2022-03-19 13:15:42,582 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:42,583 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:42,583 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-03-19 13:15:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-03-19 13:15:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1151 states have (on average 1.4378801042571676) internal successors, (1655), 1151 states have internal predecessors, (1655), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-03-19 13:15:42,635 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 140 [2022-03-19 13:15:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:42,636 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-03-19 13:15:42,636 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-03-19 13:15:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-03-19 13:15:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-03-19 13:15:42,638 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:42,638 INFO L500 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-03-19 13:15:42,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 13:15:42,638 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 1 times [2022-03-19 13:15:42,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485659562] [2022-03-19 13:15:42,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1075054782, now seen corresponding path program 2 times [2022-03-19 13:15:42,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:42,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430899624] [2022-03-19 13:15:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:42,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-03-19 13:15:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430899624] [2022-03-19 13:15:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430899624] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485659562] [2022-03-19 13:15:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485659562] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:42,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:42,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842535738] [2022-03-19 13:15:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:42,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:42,688 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-03-19 13:15:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:42,907 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-03-19 13:15:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:42,907 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-03-19 13:15:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:42,911 INFO L225 Difference]: With dead ends: 2405 [2022-03-19 13:15:42,911 INFO L226 Difference]: Without dead ends: 1262 [2022-03-19 13:15:42,913 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:42,913 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:42,914 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-03-19 13:15:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-03-19 13:15:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1243 states have (on average 1.421560740144811) internal successors, (1767), 1243 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-03-19 13:15:42,970 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 176 [2022-03-19 13:15:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:42,970 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-03-19 13:15:42,970 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-03-19 13:15:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-03-19 13:15:42,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-03-19 13:15:42,972 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:42,973 INFO L500 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-03-19 13:15:42,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 13:15:42,973 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:42,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 1 times [2022-03-19 13:15:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:42,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1494649071] [2022-03-19 13:15:42,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1144207012, now seen corresponding path program 2 times [2022-03-19 13:15:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:42,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461412157] [2022-03-19 13:15:42,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:42,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-03-19 13:15:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:43,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461412157] [2022-03-19 13:15:43,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461412157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:43,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1494649071] [2022-03-19 13:15:43,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1494649071] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093126720] [2022-03-19 13:15:43,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:43,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:43,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:43,013 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-03-19 13:15:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:43,226 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-03-19 13:15:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:43,227 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-03-19 13:15:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:43,231 INFO L225 Difference]: With dead ends: 2595 [2022-03-19 13:15:43,232 INFO L226 Difference]: Without dead ends: 1360 [2022-03-19 13:15:43,234 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:43,235 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:43,236 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 193 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-19 13:15:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-03-19 13:15:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1343 states have (on average 1.4050632911392404) internal successors, (1887), 1343 states have internal predecessors, (1887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-03-19 13:15:43,297 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 197 [2022-03-19 13:15:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:43,297 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-03-19 13:15:43,297 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-03-19 13:15:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-03-19 13:15:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-03-19 13:15:43,299 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:43,299 INFO L500 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-03-19 13:15:43,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 13:15:43,300 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 1 times [2022-03-19 13:15:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380741047] [2022-03-19 13:15:43,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1731794615, now seen corresponding path program 2 times [2022-03-19 13:15:43,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:43,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875758016] [2022-03-19 13:15:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-03-19 13:15:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:43,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875758016] [2022-03-19 13:15:43,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875758016] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:43,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380741047] [2022-03-19 13:15:43,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380741047] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638882982] [2022-03-19 13:15:43,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:43,355 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:43,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:43,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:43,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:43,357 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-03-19 13:15:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:43,649 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-03-19 13:15:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:43,650 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-03-19 13:15:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:43,656 INFO L225 Difference]: With dead ends: 2803 [2022-03-19 13:15:43,656 INFO L226 Difference]: Without dead ends: 1468 [2022-03-19 13:15:43,659 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:43,659 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:43,660 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-03-19 13:15:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-03-19 13:15:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1455 states have (on average 1.3876288659793814) internal successors, (2019), 1455 states have internal predecessors, (2019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-03-19 13:15:43,741 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 221 [2022-03-19 13:15:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:43,741 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-03-19 13:15:43,741 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-03-19 13:15:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-03-19 13:15:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-03-19 13:15:43,744 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:43,745 INFO L500 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-03-19 13:15:43,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 13:15:43,745 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 1 times [2022-03-19 13:15:43,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:43,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411674344] [2022-03-19 13:15:43,748 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -700753717, now seen corresponding path program 2 times [2022-03-19 13:15:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:43,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133963849] [2022-03-19 13:15:43,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-03-19 13:15:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:43,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133963849] [2022-03-19 13:15:43,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133963849] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:43,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411674344] [2022-03-19 13:15:43,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411674344] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:43,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:43,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579000429] [2022-03-19 13:15:43,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:43,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:43,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:43,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:43,797 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-03-19 13:15:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:44,070 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-03-19 13:15:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:44,070 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-03-19 13:15:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:44,075 INFO L225 Difference]: With dead ends: 3043 [2022-03-19 13:15:44,075 INFO L226 Difference]: Without dead ends: 1596 [2022-03-19 13:15:44,078 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:44,078 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:44,079 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 194 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-03-19 13:15:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-03-19 13:15:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1579 states have (on average 1.3698543381887271) internal successors, (2163), 1579 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-03-19 13:15:44,137 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 221 [2022-03-19 13:15:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:44,137 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-03-19 13:15:44,137 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-03-19 13:15:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-03-19 13:15:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-03-19 13:15:44,140 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:44,141 INFO L500 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-03-19 13:15:44,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 13:15:44,141 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:44,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 1 times [2022-03-19 13:15:44,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:44,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955846535] [2022-03-19 13:15:44,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1663434775, now seen corresponding path program 2 times [2022-03-19 13:15:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:44,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897121079] [2022-03-19 13:15:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-03-19 13:15:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897121079] [2022-03-19 13:15:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897121079] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:44,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:44,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955846535] [2022-03-19 13:15:44,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955846535] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:44,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:44,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338633736] [2022-03-19 13:15:44,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:44,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:44,190 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-03-19 13:15:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:44,445 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-03-19 13:15:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:44,446 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-03-19 13:15:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:44,454 INFO L225 Difference]: With dead ends: 4722 [2022-03-19 13:15:44,454 INFO L226 Difference]: Without dead ends: 3151 [2022-03-19 13:15:44,456 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:44,456 INFO L912 BasicCegarLoop]: 326 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:44,457 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-03-19 13:15:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-03-19 13:15:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3144 states have (on average 1.3689567430025444) internal successors, (4304), 3144 states have internal predecessors, (4304), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-03-19 13:15:44,609 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 251 [2022-03-19 13:15:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:44,609 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-03-19 13:15:44,609 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-03-19 13:15:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-03-19 13:15:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-03-19 13:15:44,615 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:44,615 INFO L500 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-03-19 13:15:44,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 13:15:44,616 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 1 times [2022-03-19 13:15:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:44,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1129575584] [2022-03-19 13:15:44,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -632393877, now seen corresponding path program 2 times [2022-03-19 13:15:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:44,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037622192] [2022-03-19 13:15:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-03-19 13:15:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037622192] [2022-03-19 13:15:44,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037622192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:44,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:44,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:44,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1129575584] [2022-03-19 13:15:44,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1129575584] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:44,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:44,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430539305] [2022-03-19 13:15:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:44,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:44,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:44,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:44,660 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-03-19 13:15:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:44,983 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-03-19 13:15:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:44,983 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-03-19 13:15:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:44,992 INFO L225 Difference]: With dead ends: 6585 [2022-03-19 13:15:44,992 INFO L226 Difference]: Without dead ends: 3449 [2022-03-19 13:15:44,997 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:44,998 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:44,998 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 194 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-03-19 13:15:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-03-19 13:15:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3433 states, 3428 states have (on average 1.3500583430571762) internal successors, (4628), 3428 states have internal predecessors, (4628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-03-19 13:15:45,163 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 251 [2022-03-19 13:15:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:45,163 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-03-19 13:15:45,163 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-03-19 13:15:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-03-19 13:15:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-03-19 13:15:45,168 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:45,168 INFO L500 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-03-19 13:15:45,168 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 13:15:45,168 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 1 times [2022-03-19 13:15:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:45,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000072839] [2022-03-19 13:15:45,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1599534867, now seen corresponding path program 2 times [2022-03-19 13:15:45,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:45,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614465058] [2022-03-19 13:15:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:45,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2022-03-19 13:15:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:45,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614465058] [2022-03-19 13:15:45,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614465058] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:45,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:45,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:45,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:45,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000072839] [2022-03-19 13:15:45,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000072839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:45,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:45,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:45,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652516770] [2022-03-19 13:15:45,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:45,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:45,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:45,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:45,213 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-03-19 13:15:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:45,497 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-03-19 13:15:45,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:45,497 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-03-19 13:15:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:45,507 INFO L225 Difference]: With dead ends: 7001 [2022-03-19 13:15:45,507 INFO L226 Difference]: Without dead ends: 3581 [2022-03-19 13:15:45,513 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:45,513 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:45,514 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-03-19 13:15:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-03-19 13:15:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3560 states have (on average 1.3426966292134832) internal successors, (4780), 3560 states have internal predecessors, (4780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-03-19 13:15:45,669 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 275 [2022-03-19 13:15:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:45,670 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-03-19 13:15:45,670 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-03-19 13:15:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-03-19 13:15:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-03-19 13:15:45,674 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:45,675 INFO L500 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-03-19 13:15:45,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 13:15:45,675 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 1 times [2022-03-19 13:15:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:45,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299241680] [2022-03-19 13:15:45,676 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash -796448876, now seen corresponding path program 2 times [2022-03-19 13:15:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385219458] [2022-03-19 13:15:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 969 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-03-19 13:15:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385219458] [2022-03-19 13:15:45,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385219458] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:45,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:45,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:45,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:45,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299241680] [2022-03-19 13:15:45,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299241680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:45,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:45,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806001226] [2022-03-19 13:15:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:45,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:45,723 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-03-19 13:15:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:46,006 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-03-19 13:15:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:46,007 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-03-19 13:15:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:46,023 INFO L225 Difference]: With dead ends: 7517 [2022-03-19 13:15:46,024 INFO L226 Difference]: Without dead ends: 3965 [2022-03-19 13:15:46,029 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:46,030 INFO L912 BasicCegarLoop]: 187 mSDtfsCounter, 228 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:46,030 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-03-19 13:15:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-03-19 13:15:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3877 states, 3872 states have (on average 1.3295454545454546) internal successors, (5148), 3872 states have internal predecessors, (5148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-03-19 13:15:46,238 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 286 [2022-03-19 13:15:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:46,238 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-03-19 13:15:46,239 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-03-19 13:15:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-03-19 13:15:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-03-19 13:15:46,245 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:46,245 INFO L500 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-03-19 13:15:46,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 13:15:46,245 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:46,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 1 times [2022-03-19 13:15:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839255290] [2022-03-19 13:15:46,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 151847702, now seen corresponding path program 2 times [2022-03-19 13:15:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:46,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526652283] [2022-03-19 13:15:46,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-03-19 13:15:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526652283] [2022-03-19 13:15:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526652283] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:46,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:46,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839255290] [2022-03-19 13:15:46,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839255290] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:46,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:46,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49518508] [2022-03-19 13:15:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:46,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:46,294 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-03-19 13:15:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:46,683 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-03-19 13:15:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:46,683 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-03-19 13:15:46,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:46,698 INFO L225 Difference]: With dead ends: 8149 [2022-03-19 13:15:46,698 INFO L226 Difference]: Without dead ends: 4285 [2022-03-19 13:15:46,705 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:46,706 INFO L912 BasicCegarLoop]: 185 mSDtfsCounter, 279 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:46,706 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 192 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-03-19 13:15:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-03-19 13:15:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3992 states have (on average 1.3256513026052104) internal successors, (5292), 3992 states have internal predecessors, (5292), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-03-19 13:15:46,954 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 300 [2022-03-19 13:15:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:46,954 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-03-19 13:15:46,954 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-03-19 13:15:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-03-19 13:15:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-03-19 13:15:46,961 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:46,962 INFO L500 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-03-19 13:15:46,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-19 13:15:46,962 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:46,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 1 times [2022-03-19 13:15:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:46,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885438347] [2022-03-19 13:15:46,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1047250296, now seen corresponding path program 2 times [2022-03-19 13:15:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:46,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054080044] [2022-03-19 13:15:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:47,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2022-03-19 13:15:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054080044] [2022-03-19 13:15:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054080044] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:47,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:47,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:47,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:47,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885438347] [2022-03-19 13:15:47,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885438347] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:47,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:47,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849258352] [2022-03-19 13:15:47,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:47,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:47,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:47,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:47,016 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-03-19 13:15:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:47,473 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-03-19 13:15:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:47,474 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-03-19 13:15:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:47,487 INFO L225 Difference]: With dead ends: 11461 [2022-03-19 13:15:47,488 INFO L226 Difference]: Without dead ends: 7477 [2022-03-19 13:15:47,497 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:47,497 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:47,497 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 325 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-19 13:15:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-03-19 13:15:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7475 states, 7470 states have (on average 1.3325301204819278) internal successors, (9954), 7470 states have internal predecessors, (9954), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-03-19 13:15:47,865 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 301 [2022-03-19 13:15:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:47,865 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-03-19 13:15:47,866 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-03-19 13:15:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-03-19 13:15:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-03-19 13:15:47,875 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:47,875 INFO L500 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-03-19 13:15:47,876 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-19 13:15:47,876 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 1 times [2022-03-19 13:15:47,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:47,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [916770947] [2022-03-19 13:15:47,877 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1156256593, now seen corresponding path program 2 times [2022-03-19 13:15:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19822267] [2022-03-19 13:15:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-03-19 13:15:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19822267] [2022-03-19 13:15:47,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19822267] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:47,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:47,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:47,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:47,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [916770947] [2022-03-19 13:15:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [916770947] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:47,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424571523] [2022-03-19 13:15:47,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:47,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:47,933 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-03-19 13:15:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:48,420 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-03-19 13:15:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:48,420 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-03-19 13:15:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:48,434 INFO L225 Difference]: With dead ends: 14945 [2022-03-19 13:15:48,434 INFO L226 Difference]: Without dead ends: 7483 [2022-03-19 13:15:48,445 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:48,445 INFO L912 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:48,446 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 13:15:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-03-19 13:15:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-03-19 13:15:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7451 states, 7446 states have (on average 1.2992210582863282) internal successors, (9674), 7446 states have internal predecessors, (9674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-03-19 13:15:48,825 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 302 [2022-03-19 13:15:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:48,825 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-03-19 13:15:48,825 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-03-19 13:15:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-03-19 13:15:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-03-19 13:15:48,833 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:48,833 INFO L500 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-03-19 13:15:48,833 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-19 13:15:48,833 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 1 times [2022-03-19 13:15:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:48,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1196243608] [2022-03-19 13:15:48,835 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:48,835 INFO L85 PathProgramCache]: Analyzing trace with hash 503831525, now seen corresponding path program 2 times [2022-03-19 13:15:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:48,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230415792] [2022-03-19 13:15:48,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:48,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 637 proven. 14 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-03-19 13:15:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:48,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230415792] [2022-03-19 13:15:48,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230415792] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 13:15:48,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767762988] [2022-03-19 13:15:48,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 13:15:48,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:48,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 13:15:48,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 13:15:49,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 13:15:49,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 13:15:49,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-19 13:15:49,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 13:15:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2022-03-19 13:15:49,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 13:15:49,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767762988] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:49,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 13:15:49,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-03-19 13:15:49,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:49,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1196243608] [2022-03-19 13:15:49,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1196243608] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:49,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:49,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 13:15:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146077604] [2022-03-19 13:15:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:49,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 13:15:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 13:15:49,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-19 13:15:49,489 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-03-19 13:15:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:50,198 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-03-19 13:15:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 13:15:50,198 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-03-19 13:15:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:50,212 INFO L225 Difference]: With dead ends: 15067 [2022-03-19 13:15:50,212 INFO L226 Difference]: Without dead ends: 7601 [2022-03-19 13:15:50,225 INFO L911 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-03-19 13:15:50,226 INFO L912 BasicCegarLoop]: 150 mSDtfsCounter, 249 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:50,226 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 384 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-03-19 13:15:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-03-19 13:15:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7457 states, 7452 states have (on average 1.299248523886205) internal successors, (9682), 7452 states have internal predecessors, (9682), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-03-19 13:15:50,694 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 325 [2022-03-19 13:15:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:50,695 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-03-19 13:15:50,695 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-03-19 13:15:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-03-19 13:15:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-03-19 13:15:50,706 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:50,706 INFO L500 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-03-19 13:15:50,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-19 13:15:50,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-19 13:15:50,922 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 1 times [2022-03-19 13:15:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:50,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613652427] [2022-03-19 13:15:50,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 629515054, now seen corresponding path program 2 times [2022-03-19 13:15:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063994796] [2022-03-19 13:15:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-03-19 13:15:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:50,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063994796] [2022-03-19 13:15:50,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063994796] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 13:15:50,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467551917] [2022-03-19 13:15:50,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 13:15:50,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:50,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:51,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 13:15:51,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 13:15:51,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 13:15:51,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 13:15:51,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 13:15:51,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 13:15:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-03-19 13:15:51,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 13:15:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-03-19 13:15:51,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467551917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 13:15:51,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 13:15:51,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-19 13:15:51,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:51,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613652427] [2022-03-19 13:15:51,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613652427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:51,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:51,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 13:15:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485354664] [2022-03-19 13:15:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:51,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 13:15:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 13:15:51,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 13:15:51,930 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-03-19 13:15:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:52,829 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-03-19 13:15:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 13:15:52,829 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-03-19 13:15:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:52,848 INFO L225 Difference]: With dead ends: 14825 [2022-03-19 13:15:52,848 INFO L226 Difference]: Without dead ends: 11185 [2022-03-19 13:15:52,856 INFO L911 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-03-19 13:15:52,857 INFO L912 BasicCegarLoop]: 362 mSDtfsCounter, 332 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:52,857 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-19 13:15:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-03-19 13:15:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-03-19 13:15:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8561 states, 8556 states have (on average 1.3064516129032258) internal successors, (11178), 8556 states have internal predecessors, (11178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 13:15:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-03-19 13:15:53,328 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 338 [2022-03-19 13:15:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:53,329 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-03-19 13:15:53,329 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-03-19 13:15:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-03-19 13:15:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-03-19 13:15:53,337 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:53,337 INFO L500 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-03-19 13:15:53,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-19 13:15:53,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-19 13:15:53,552 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 3 times [2022-03-19 13:15:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221322199] [2022-03-19 13:15:53,553 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:53,553 INFO L85 PathProgramCache]: Analyzing trace with hash -804487531, now seen corresponding path program 4 times [2022-03-19 13:15:53,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:53,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53207848] [2022-03-19 13:15:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 714 proven. 5 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2022-03-19 13:15:53,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53207848] [2022-03-19 13:15:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53207848] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 13:15:53,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434443268] [2022-03-19 13:15:53,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 13:15:53,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:53,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 13:15:53,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 13:15:53,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 13:15:53,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 13:15:53,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 13:15:53,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 13:15:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 835 trivial. 0 not checked. [2022-03-19 13:15:54,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-19 13:15:54,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434443268] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:54,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-19 13:15:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-19 13:15:54,232 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221322199] [2022-03-19 13:15:54,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221322199] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:54,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 13:15:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641170607] [2022-03-19 13:15:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:54,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 13:15:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 13:15:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-19 13:15:54,233 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-03-19 13:15:54,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:54,672 INFO L93 Difference]: Finished difference Result 14704 states and 18910 transitions. [2022-03-19 13:15:54,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 13:15:54,672 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-03-19 13:15:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:54,683 INFO L225 Difference]: With dead ends: 14704 [2022-03-19 13:15:54,683 INFO L226 Difference]: Without dead ends: 6162 [2022-03-19 13:15:54,696 INFO L911 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-03-19 13:15:54,696 INFO L912 BasicCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-03-19 13:15:54,701 INFO L913 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-03-19 13:15:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-03-19 13:15:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 5972. [2022-03-19 13:15:55,062 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-03-19 13:15:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5972 states to 5972 states and 7494 transitions. [2022-03-19 13:15:55,070 INFO L78 Accepts]: Start accepts. Automaton has 5972 states and 7494 transitions. Word has length 351 [2022-03-19 13:15:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:55,072 INFO L478 AbstractCegarLoop]: Abstraction has 5972 states and 7494 transitions. [2022-03-19 13:15:55,072 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-03-19 13:15:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 5972 states and 7494 transitions. [2022-03-19 13:15:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2022-03-19 13:15:55,077 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:55,077 INFO L500 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-19 13:15:55,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 13:15:55,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:55,292 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 1 times [2022-03-19 13:15:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:55,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005599040] [2022-03-19 13:15:55,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:55,293 INFO L85 PathProgramCache]: Analyzing trace with hash 627308297, now seen corresponding path program 2 times [2022-03-19 13:15:55,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:55,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795542511] [2022-03-19 13:15:55,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:55,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 13:15:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:55,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795542511] [2022-03-19 13:15:55,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795542511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 13:15:55,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858736022] [2022-03-19 13:15:55,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 13:15:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:55,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 13:15:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 13:15:55,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 13:15:55,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 13:15:55,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 13:15:55,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 13:15:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 13:15:55,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 13:15:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-19 13:15:56,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858736022] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 13:15:56,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 13:15:56,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-19 13:15:56,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:56,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005599040] [2022-03-19 13:15:56,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005599040] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:56,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:56,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 13:15:56,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998941956] [2022-03-19 13:15:56,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:56,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 13:15:56,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:56,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 13:15:56,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 13:15:56,364 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-03-19 13:15:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:57,094 INFO L93 Difference]: Finished difference Result 12972 states and 16213 transitions. [2022-03-19 13:15:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 13:15:57,094 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-03-19 13:15:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:57,105 INFO L225 Difference]: With dead ends: 12972 [2022-03-19 13:15:57,106 INFO L226 Difference]: Without dead ends: 7040 [2022-03-19 13:15:57,120 INFO L911 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-03-19 13:15:57,120 INFO L912 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-03-19 13:15:57,122 INFO L913 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-03-19 13:15:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2022-03-19 13:15:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 6098. [2022-03-19 13:15:57,569 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-03-19 13:15:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 7605 transitions. [2022-03-19 13:15:57,579 INFO L78 Accepts]: Start accepts. Automaton has 6098 states and 7605 transitions. Word has length 382 [2022-03-19 13:15:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:57,580 INFO L478 AbstractCegarLoop]: Abstraction has 6098 states and 7605 transitions. [2022-03-19 13:15:57,580 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-03-19 13:15:57,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6098 states and 7605 transitions. [2022-03-19 13:15:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2022-03-19 13:15:57,586 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:57,586 INFO L500 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 13:15:57,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 13:15:57,800 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-03-19 13:15:57,800 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 1 times [2022-03-19 13:15:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406502793] [2022-03-19 13:15:57,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1284701442, now seen corresponding path program 2 times [2022-03-19 13:15:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:57,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076582868] [2022-03-19 13:15:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:57,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:57,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-03-19 13:15:57,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076582868] [2022-03-19 13:15:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076582868] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:57,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:57,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:57,876 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406502793] [2022-03-19 13:15:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406502793] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:57,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:57,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 13:15:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034769121] [2022-03-19 13:15:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:57,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 13:15:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 13:15:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 13:15:57,877 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-03-19 13:15:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:15:58,325 INFO L93 Difference]: Finished difference Result 11742 states and 14397 transitions. [2022-03-19 13:15:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 13:15:58,326 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-03-19 13:15:58,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:15:58,330 INFO L225 Difference]: With dead ends: 11742 [2022-03-19 13:15:58,330 INFO L226 Difference]: Without dead ends: 2973 [2022-03-19 13:15:58,340 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 13:15:58,341 INFO L912 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 13:15:58,344 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 192 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 13:15:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-03-19 13:15:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2807. [2022-03-19 13:15:58,474 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-03-19 13:15:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2807 states to 2807 states and 3471 transitions. [2022-03-19 13:15:58,477 INFO L78 Accepts]: Start accepts. Automaton has 2807 states and 3471 transitions. Word has length 421 [2022-03-19 13:15:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:15:58,477 INFO L478 AbstractCegarLoop]: Abstraction has 2807 states and 3471 transitions. [2022-03-19 13:15:58,478 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-03-19 13:15:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2807 states and 3471 transitions. [2022-03-19 13:15:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-03-19 13:15:58,481 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 13:15:58,481 INFO L500 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-03-19 13:15:58,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-19 13:15:58,482 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 13:15:58,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 13:15:58,482 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 1 times [2022-03-19 13:15:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:58,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1982350157] [2022-03-19 13:15:58,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 13:15:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -359683297, now seen corresponding path program 2 times [2022-03-19 13:15:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 13:15:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891542672] [2022-03-19 13:15:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 13:15:58,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 13:15:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 13:15:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 13:15:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-03-19 13:15:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 13:15:58,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891542672] [2022-03-19 13:15:58,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891542672] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 13:15:58,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283967424] [2022-03-19 13:15:58,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 13:15:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 13:15:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 13:15:58,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 13:15:58,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 13:15:58,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 13:15:58,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 13:15:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-19 13:15:58,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 13:15:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-03-19 13:15:59,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 13:15:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-03-19 13:15:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283967424] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 13:15:59,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 13:15:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-03-19 13:15:59,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 13:15:59,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1982350157] [2022-03-19 13:15:59,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1982350157] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 13:15:59,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 13:15:59,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 13:15:59,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749861374] [2022-03-19 13:15:59,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 13:15:59,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 13:15:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 13:15:59,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 13:15:59,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 13:15:59,999 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-03-19 13:16:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 13:16:00,238 INFO L93 Difference]: Finished difference Result 3042 states and 3766 transitions. [2022-03-19 13:16:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 13:16:00,238 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-03-19 13:16:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 13:16:00,239 INFO L225 Difference]: With dead ends: 3042 [2022-03-19 13:16:00,239 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 13:16:00,250 INFO L911 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-03-19 13:16:00,252 INFO L912 BasicCegarLoop]: 166 mSDtfsCounter, 151 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-19 13:16:00,253 INFO L913 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-03-19 13:16:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 13:16:00,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 13:16:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-19 13:16:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 13:16:00,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 488 [2022-03-19 13:16:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 13:16:00,257 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 13:16:00,257 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-03-19 13:16:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 13:16:00,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 13:16:00,263 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-19 13:16:00,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-19 13:16:00,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-19 13:16:00,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 13:16:40,853 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-03-19 13:16:40,853 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-03-19 13:16:40,854 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-03-19 13:16:40,854 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,854 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 13:16:40,854 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,854 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-03-19 13:16:40,854 INFO L878 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 13:16:40,854 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-03-19 13:16:40,854 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 245) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,854 INFO L878 garLoopResultBuilder]: At program point L234-2(lines 213 496) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,855 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-03-19 13:16:40,855 INFO L878 garLoopResultBuilder]: At program point L301(lines 301 303) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 13:16:40,855 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-03-19 13:16:40,855 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-03-19 13:16:40,855 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-03-19 13:16:40,855 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-03-19 13:16:40,855 INFO L878 garLoopResultBuilder]: At program point L236(lines 236 239) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,855 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-03-19 13:16:40,855 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-03-19 13:16:40,855 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-03-19 13:16:40,856 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 108) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 INFO L878 garLoopResultBuilder]: At program point L105(lines 105 107) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,856 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-03-19 13:16:40,857 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-03-19 13:16:40,857 INFO L878 garLoopResultBuilder]: At program point L240(lines 240 243) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,857 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-03-19 13:16:40,857 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-03-19 13:16:40,857 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-03-19 13:16:40,857 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-03-19 13:16:40,857 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-03-19 13:16:40,857 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-03-19 13:16:40,857 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-03-19 13:16:40,857 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-03-19 13:16:40,857 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-03-19 13:16:40,857 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-03-19 13:16:40,857 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 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-03-19 13:16:40,858 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,858 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-03-19 13:16:40,858 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-03-19 13:16:40,858 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 INFO L878 garLoopResultBuilder]: At program point L250(lines 250 253) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,859 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-03-19 13:16:40,860 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-03-19 13:16:40,860 INFO L878 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-03-19 13:16:40,860 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-03-19 13:16:40,860 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 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-03-19 13:16:40,860 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,861 INFO L878 garLoopResultBuilder]: At program point L223-2(lines 223 225) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-03-19 13:16:40,861 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 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-03-19 13:16:40,861 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-03-19 13:16:40,861 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-03-19 13:16:40,861 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-03-19 13:16:40,861 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-03-19 13:16:40,862 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-03-19 13:16:40,862 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-03-19 13:16:40,862 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-03-19 13:16:40,862 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-03-19 13:16:40,862 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-03-19 13:16:40,862 INFO L878 garLoopResultBuilder]: At program point L228(lines 228 231) the Hoare annotation is: (or (= ssl3_connect_~blastFlag~0 0) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,862 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-03-19 13:16:40,862 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-03-19 13:16:40,862 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 102) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,863 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-03-19 13:16:40,863 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-03-19 13:16:40,863 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-03-19 13:16:40,863 INFO L878 garLoopResultBuilder]: At program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-19 13:16:40,863 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-03-19 13:16:40,863 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-03-19 13:16:40,863 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-03-19 13:16:40,864 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-03-19 13:16:40,864 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-03-19 13:16:40,864 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-03-19 13:16:40,864 INFO L878 garLoopResultBuilder]: At program point L99(lines 99 101) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,864 INFO L878 garLoopResultBuilder]: At program point L99-2(lines 96 102) the Hoare annotation is: (or (and (<= 12292 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-19 13:16:40,864 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-03-19 13:16:40,865 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-03-19 13:16:40,865 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-03-19 13:16:40,865 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-03-19 13:16:40,865 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-03-19 13:16:40,865 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-03-19 13:16:40,865 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,865 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,865 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,865 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 13:16:40,870 INFO L718 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 13:16:40,871 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 13:16:40,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 01:16:40 BoogieIcfgContainer [2022-03-19 13:16:40,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 13:16:40,899 INFO L158 Benchmark]: Toolchain (without parser) took 62867.38ms. Allocated memory was 173.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 149.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-19 13:16:40,899 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 173.0MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 13:16:40,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.75ms. Allocated memory is still 173.0MB. Free memory was 149.0MB in the beginning and 142.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-03-19 13:16:40,899 INFO L158 Benchmark]: Boogie Preprocessor took 32.39ms. Allocated memory is still 173.0MB. Free memory was 142.4MB in the beginning and 140.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 13:16:40,899 INFO L158 Benchmark]: RCFGBuilder took 488.44ms. Allocated memory is still 173.0MB. Free memory was 140.1MB in the beginning and 113.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-03-19 13:16:40,899 INFO L158 Benchmark]: TraceAbstraction took 62063.66ms. Allocated memory was 173.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 113.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-03-19 13:16:40,905 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.14ms. Allocated memory is still 173.0MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.75ms. Allocated memory is still 173.0MB. Free memory was 149.0MB in the beginning and 142.4MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.39ms. Allocated memory is still 173.0MB. Free memory was 142.4MB in the beginning and 140.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.44ms. Allocated memory is still 173.0MB. Free memory was 140.1MB in the beginning and 113.8MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 62063.66ms. Allocated memory was 173.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 113.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.4GB. 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: 62.0s, OverallIterations: 28, TraceHistogramMax: 18, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6756 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6754 mSDsluCounter, 6314 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 521 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5664 IncrementalHoareTripleChecker+Invalid, 6204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 5793 mSDtfsCounter, 5664 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.3s 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: 4.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 4666 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 3275 NumberOfFragments, 10540 HoareAnnotationTreeSize, 137 FomulaSimplifications, 67412 FormulaSimplificationTreeSizeReduction, 11.0s HoareSimplificationTime, 137 FomulaSimplificationsInter, 140763 FormulaSimplificationTreeSizeReductionInter, 29.3s 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-03-19 13:16:40,934 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...