/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 17:15:24,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 17:15:24,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 17:15:24,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 17:15:24,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 17:15:24,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 17:15:24,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 17:15:24,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 17:15:24,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 17:15:24,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 17:15:24,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 17:15:24,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 17:15:24,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 17:15:24,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 17:15:24,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 17:15:24,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 17:15:24,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 17:15:24,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 17:15:24,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 17:15:24,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 17:15:24,212 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 17:15:24,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 17:15:24,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 17:15:24,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 17:15:24,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 17:15:24,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 17:15:24,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 17:15:24,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 17:15:24,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 17:15:24,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 17:15:24,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 17:15:24,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 17:15:24,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 17:15:24,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 17:15:24,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 17:15:24,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 17:15:24,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 17:15:24,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 17:15:24,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 17:15:24,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 17:15:24,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 17:15:24,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 17:15:24,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 17:15:24,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 17:15:24,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 17:15:24,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 17:15:24,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 17:15:24,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 17:15:24,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 17:15:24,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 17:15:24,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 17:15:24,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 17:15:24,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 17:15:24,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:15:24,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 17:15:24,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 17:15:24,241 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 17:15:24,241 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-20 17:15:24,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 17:15:24,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 17:15:24,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 17:15:24,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 17:15:24,463 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 17:15:24,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-03-20 17:15:24,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dacef19/b6912fb965cc4ded8f83859f9566dc44/FLAGbb34155a5 [2022-03-20 17:15:24,880 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 17:15:24,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c [2022-03-20 17:15:24,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dacef19/b6912fb965cc4ded8f83859f9566dc44/FLAGbb34155a5 [2022-03-20 17:15:24,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dacef19/b6912fb965cc4ded8f83859f9566dc44 [2022-03-20 17:15:24,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 17:15:24,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 17:15:24,901 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 17:15:24,901 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 17:15:24,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 17:15:24,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:15:24" (1/1) ... [2022-03-20 17:15:24,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb0cdb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:24, skipping insertion in model container [2022-03-20 17:15:24,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:15:24" (1/1) ... [2022-03-20 17:15:24,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 17:15:24,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 17:15:25,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-03-20 17:15:25,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:15:25,135 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 17:15:25,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_2.cil-2.c[35827,35840] [2022-03-20 17:15:25,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:15:25,186 INFO L208 MainTranslator]: Completed translation [2022-03-20 17:15:25,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25 WrapperNode [2022-03-20 17:15:25,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 17:15:25,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 17:15:25,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 17:15:25,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 17:15:25,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 17:15:25,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 17:15:25,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 17:15:25,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 17:15:25,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (1/1) ... [2022-03-20 17:15:25,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:15:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:25,299 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-20 17:15:25,302 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-20 17:15:25,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 17:15:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 17:15:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 17:15:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-03-20 17:15:25,327 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-03-20 17:15:25,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 17:15:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 17:15:25,414 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 17:15:25,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 17:15:25,482 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 17:15:25,716 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-03-20 17:15:25,717 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-03-20 17:15:25,719 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 17:15:25,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 17:15:25,725 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 17:15:25,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:15:25 BoogieIcfgContainer [2022-03-20 17:15:25,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 17:15:25,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 17:15:25,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 17:15:25,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 17:15:25,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:15:24" (1/3) ... [2022-03-20 17:15:25,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678cac4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:15:25, skipping insertion in model container [2022-03-20 17:15:25,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:15:25" (2/3) ... [2022-03-20 17:15:25,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678cac4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:15:25, skipping insertion in model container [2022-03-20 17:15:25,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:15:25" (3/3) ... [2022-03-20 17:15:25,732 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-2.c [2022-03-20 17:15:25,735 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 17:15:25,736 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 17:15:25,763 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 17:15:25,768 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-20 17:15:25,768 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 17:15:25,785 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-20 17:15:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-20 17:15:25,798 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:25,799 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:25,800 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 1 times [2022-03-20 17:15:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129536430] [2022-03-20 17:15:25,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -53499867, now seen corresponding path program 2 times [2022-03-20 17:15:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:25,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308887987] [2022-03-20 17:15:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,033 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-20 17:15:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:26,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308887987] [2022-03-20 17:15:26,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308887987] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:26,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2129536430] [2022-03-20 17:15:26,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2129536430] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098670135] [2022-03-20 17:15:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:26,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:26,060 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-20 17:15:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:26,418 INFO L93 Difference]: Finished difference Result 375 states and 629 transitions. [2022-03-20 17:15:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:26,420 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-20 17:15:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:26,427 INFO L225 Difference]: With dead ends: 375 [2022-03-20 17:15:26,427 INFO L226 Difference]: Without dead ends: 218 [2022-03-20 17:15:26,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:26,432 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 576 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:26,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 225 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 17:15:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-20 17:15:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-03-20 17:15:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 213 states have (on average 1.4929577464788732) internal successors, (318), 213 states have internal predecessors, (318), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2022-03-20 17:15:26,477 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 30 [2022-03-20 17:15:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:26,477 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2022-03-20 17:15:26,478 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-20 17:15:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2022-03-20 17:15:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 17:15:26,479 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:26,479 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:26,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 17:15:26,480 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 1 times [2022-03-20 17:15:26,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:26,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273015716] [2022-03-20 17:15:26,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash 479708172, now seen corresponding path program 2 times [2022-03-20 17:15:26,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:26,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097033015] [2022-03-20 17:15:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,539 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-20 17:15:26,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:26,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097033015] [2022-03-20 17:15:26,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097033015] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:26,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273015716] [2022-03-20 17:15:26,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273015716] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495671130] [2022-03-20 17:15:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:26,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:26,542 INFO L87 Difference]: Start difference. First operand 218 states and 322 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:26,705 INFO L93 Difference]: Finished difference Result 348 states and 521 transitions. [2022-03-20 17:15:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:26,706 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-20 17:15:26,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:26,707 INFO L225 Difference]: With dead ends: 348 [2022-03-20 17:15:26,707 INFO L226 Difference]: Without dead ends: 243 [2022-03-20 17:15:26,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:26,709 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 189 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:26,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:26,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-03-20 17:15:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 235. [2022-03-20 17:15:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.4782608695652173) internal successors, (340), 230 states have internal predecessors, (340), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 344 transitions. [2022-03-20 17:15:26,725 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 344 transitions. Word has length 44 [2022-03-20 17:15:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:26,725 INFO L478 AbstractCegarLoop]: Abstraction has 235 states and 344 transitions. [2022-03-20 17:15:26,725 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-20 17:15:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 344 transitions. [2022-03-20 17:15:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 17:15:26,727 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:26,727 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:26,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 17:15:26,727 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 1 times [2022-03-20 17:15:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794096189] [2022-03-20 17:15:26,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -7403090, now seen corresponding path program 2 times [2022-03-20 17:15:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096526591] [2022-03-20 17:15:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:26,780 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-20 17:15:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:26,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096526591] [2022-03-20 17:15:26,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096526591] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:26,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794096189] [2022-03-20 17:15:26,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794096189] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:26,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:26,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103181974] [2022-03-20 17:15:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:26,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:26,782 INFO L87 Difference]: Start difference. First operand 235 states and 344 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:26,991 INFO L93 Difference]: Finished difference Result 559 states and 849 transitions. [2022-03-20 17:15:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:26,992 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-20 17:15:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:26,994 INFO L225 Difference]: With dead ends: 559 [2022-03-20 17:15:26,994 INFO L226 Difference]: Without dead ends: 335 [2022-03-20 17:15:26,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:26,999 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 17:15:27,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 204 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-03-20 17:15:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2022-03-20 17:15:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.4102564102564104) internal successors, (440), 312 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 444 transitions. [2022-03-20 17:15:27,023 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 444 transitions. Word has length 61 [2022-03-20 17:15:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:27,024 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 444 transitions. [2022-03-20 17:15:27,024 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-20 17:15:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 444 transitions. [2022-03-20 17:15:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-20 17:15:27,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:27,026 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:27,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 17:15:27,026 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 1 times [2022-03-20 17:15:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [906312561] [2022-03-20 17:15:27,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:27,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1812841424, now seen corresponding path program 2 times [2022-03-20 17:15:27,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:27,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001937679] [2022-03-20 17:15:27,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,073 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-20 17:15:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:27,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001937679] [2022-03-20 17:15:27,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001937679] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:27,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [906312561] [2022-03-20 17:15:27,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [906312561] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967289143] [2022-03-20 17:15:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:27,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:27,076 INFO L87 Difference]: Start difference. First operand 317 states and 444 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:27,256 INFO L93 Difference]: Finished difference Result 669 states and 952 transitions. [2022-03-20 17:15:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:27,256 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-20 17:15:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:27,258 INFO L225 Difference]: With dead ends: 669 [2022-03-20 17:15:27,258 INFO L226 Difference]: Without dead ends: 365 [2022-03-20 17:15:27,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:27,259 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:27,260 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-03-20 17:15:27,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 355. [2022-03-20 17:15:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 350 states have (on average 1.3942857142857144) internal successors, (488), 350 states have internal predecessors, (488), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 492 transitions. [2022-03-20 17:15:27,278 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 492 transitions. Word has length 61 [2022-03-20 17:15:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:27,278 INFO L478 AbstractCegarLoop]: Abstraction has 355 states and 492 transitions. [2022-03-20 17:15:27,279 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-20 17:15:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 492 transitions. [2022-03-20 17:15:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-20 17:15:27,283 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:27,285 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:27,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 17:15:27,288 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 1 times [2022-03-20 17:15:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764349545] [2022-03-20 17:15:27,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 140161555, now seen corresponding path program 2 times [2022-03-20 17:15:27,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326493516] [2022-03-20 17:15:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,360 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-20 17:15:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:27,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326493516] [2022-03-20 17:15:27,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326493516] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:27,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [764349545] [2022-03-20 17:15:27,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [764349545] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219518755] [2022-03-20 17:15:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:27,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:27,362 INFO L87 Difference]: Start difference. First operand 355 states and 492 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:27,576 INFO L93 Difference]: Finished difference Result 803 states and 1151 transitions. [2022-03-20 17:15:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:27,577 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-20 17:15:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:27,580 INFO L225 Difference]: With dead ends: 803 [2022-03-20 17:15:27,580 INFO L226 Difference]: Without dead ends: 459 [2022-03-20 17:15:27,581 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:27,582 INFO L913 BasicCegarLoop]: 174 mSDtfsCounter, 295 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:27,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 181 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-03-20 17:15:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 433. [2022-03-20 17:15:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.4532710280373833) internal successors, (622), 428 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 626 transitions. [2022-03-20 17:15:27,604 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 626 transitions. Word has length 74 [2022-03-20 17:15:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:27,605 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 626 transitions. [2022-03-20 17:15:27,605 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-20 17:15:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 626 transitions. [2022-03-20 17:15:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-20 17:15:27,606 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:27,606 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:27,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 17:15:27,607 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 1 times [2022-03-20 17:15:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729525147] [2022-03-20 17:15:27,608 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1706902904, now seen corresponding path program 2 times [2022-03-20 17:15:27,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450412198] [2022-03-20 17:15:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,694 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-20 17:15:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450412198] [2022-03-20 17:15:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450412198] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:27,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729525147] [2022-03-20 17:15:27,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729525147] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289486677] [2022-03-20 17:15:27,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:27,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:27,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:27,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:27,696 INFO L87 Difference]: Start difference. First operand 433 states and 626 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:27,875 INFO L93 Difference]: Finished difference Result 901 states and 1312 transitions. [2022-03-20 17:15:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:27,876 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-20 17:15:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:27,878 INFO L225 Difference]: With dead ends: 901 [2022-03-20 17:15:27,878 INFO L226 Difference]: Without dead ends: 481 [2022-03-20 17:15:27,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:27,879 INFO L913 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-20 17:15:27,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 193 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-20 17:15:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2022-03-20 17:15:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 470 states have (on average 1.4340425531914893) internal successors, (674), 470 states have internal predecessors, (674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 678 transitions. [2022-03-20 17:15:27,902 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 678 transitions. Word has length 78 [2022-03-20 17:15:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:27,902 INFO L478 AbstractCegarLoop]: Abstraction has 475 states and 678 transitions. [2022-03-20 17:15:27,902 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-20 17:15:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 678 transitions. [2022-03-20 17:15:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-20 17:15:27,903 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:27,903 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:27,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 17:15:27,904 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 1 times [2022-03-20 17:15:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1096632234] [2022-03-20 17:15:27,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1231515182, now seen corresponding path program 2 times [2022-03-20 17:15:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309990488] [2022-03-20 17:15:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:27,942 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-20 17:15:27,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309990488] [2022-03-20 17:15:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309990488] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1096632234] [2022-03-20 17:15:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1096632234] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:27,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:27,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888999269] [2022-03-20 17:15:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:27,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:27,944 INFO L87 Difference]: Start difference. First operand 475 states and 678 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:28,154 INFO L93 Difference]: Finished difference Result 956 states and 1370 transitions. [2022-03-20 17:15:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:28,155 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-20 17:15:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:28,158 INFO L225 Difference]: With dead ends: 956 [2022-03-20 17:15:28,158 INFO L226 Difference]: Without dead ends: 714 [2022-03-20 17:15:28,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:28,160 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 289 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:28,160 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 323 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-03-20 17:15:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2022-03-20 17:15:28,223 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-20 17:15:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1017 transitions. [2022-03-20 17:15:28,225 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1017 transitions. Word has length 98 [2022-03-20 17:15:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:28,225 INFO L478 AbstractCegarLoop]: Abstraction has 714 states and 1017 transitions. [2022-03-20 17:15:28,226 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-20 17:15:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1017 transitions. [2022-03-20 17:15:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-03-20 17:15:28,246 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:28,246 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:28,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 17:15:28,246 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:28,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 1 times [2022-03-20 17:15:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067817371] [2022-03-20 17:15:28,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1910787436, now seen corresponding path program 2 times [2022-03-20 17:15:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:28,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100462916] [2022-03-20 17:15:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,303 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-20 17:15:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100462916] [2022-03-20 17:15:28,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100462916] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067817371] [2022-03-20 17:15:28,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067817371] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131179512] [2022-03-20 17:15:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:28,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:28,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:28,306 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-20 17:15:28,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:28,477 INFO L93 Difference]: Finished difference Result 1216 states and 1731 transitions. [2022-03-20 17:15:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:28,477 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-20 17:15:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:28,480 INFO L225 Difference]: With dead ends: 1216 [2022-03-20 17:15:28,480 INFO L226 Difference]: Without dead ends: 735 [2022-03-20 17:15:28,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:28,481 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:28,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 204 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-03-20 17:15:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-03-20 17:15:28,510 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-20 17:15:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1044 transitions. [2022-03-20 17:15:28,512 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1044 transitions. Word has length 98 [2022-03-20 17:15:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:28,513 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 1044 transitions. [2022-03-20 17:15:28,513 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-20 17:15:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1044 transitions. [2022-03-20 17:15:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-20 17:15:28,514 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:28,514 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:28,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 17:15:28,514 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 1 times [2022-03-20 17:15:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046481115] [2022-03-20 17:15:28,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2125104952, now seen corresponding path program 2 times [2022-03-20 17:15:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:28,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663630902] [2022-03-20 17:15:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,545 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-20 17:15:28,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:28,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663630902] [2022-03-20 17:15:28,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663630902] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:28,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046481115] [2022-03-20 17:15:28,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046481115] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235381427] [2022-03-20 17:15:28,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:28,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:28,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:28,546 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-20 17:15:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:28,745 INFO L93 Difference]: Finished difference Result 1262 states and 1788 transitions. [2022-03-20 17:15:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:28,746 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-20 17:15:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:28,748 INFO L225 Difference]: With dead ends: 1262 [2022-03-20 17:15:28,749 INFO L226 Difference]: Without dead ends: 760 [2022-03-20 17:15:28,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:28,751 INFO L913 BasicCegarLoop]: 203 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:28,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 210 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-03-20 17:15:28,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2022-03-20 17:15:28,779 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-20 17:15:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1074 transitions. [2022-03-20 17:15:28,782 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1074 transitions. Word has length 100 [2022-03-20 17:15:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:28,782 INFO L478 AbstractCegarLoop]: Abstraction has 760 states and 1074 transitions. [2022-03-20 17:15:28,782 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-20 17:15:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1074 transitions. [2022-03-20 17:15:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-03-20 17:15:28,783 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:28,783 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:28,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 17:15:28,783 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 1 times [2022-03-20 17:15:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139649388] [2022-03-20 17:15:28,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2035848838, now seen corresponding path program 2 times [2022-03-20 17:15:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:28,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819867056] [2022-03-20 17:15:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:28,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:28,825 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-20 17:15:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819867056] [2022-03-20 17:15:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819867056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:28,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139649388] [2022-03-20 17:15:28,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139649388] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:28,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:28,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:28,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971159019] [2022-03-20 17:15:28,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:28,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:28,826 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-20 17:15:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:29,080 INFO L93 Difference]: Finished difference Result 1002 states and 1421 transitions. [2022-03-20 17:15:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:29,080 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-20 17:15:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:29,083 INFO L225 Difference]: With dead ends: 1002 [2022-03-20 17:15:29,083 INFO L226 Difference]: Without dead ends: 1000 [2022-03-20 17:15:29,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:29,084 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 459 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:29,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 171 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-20 17:15:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-03-20 17:15:29,122 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-20 17:15:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1419 transitions. [2022-03-20 17:15:29,125 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1419 transitions. Word has length 100 [2022-03-20 17:15:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:29,125 INFO L478 AbstractCegarLoop]: Abstraction has 1000 states and 1419 transitions. [2022-03-20 17:15:29,125 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-20 17:15:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1419 transitions. [2022-03-20 17:15:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-03-20 17:15:29,127 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:29,127 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:29,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 17:15:29,128 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:29,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 1 times [2022-03-20 17:15:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487456637] [2022-03-20 17:15:29,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash -967015081, now seen corresponding path program 2 times [2022-03-20 17:15:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:29,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731341584] [2022-03-20 17:15:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-03-20 17:15:29,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:29,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731341584] [2022-03-20 17:15:29,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731341584] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:29,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487456637] [2022-03-20 17:15:29,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487456637] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020770168] [2022-03-20 17:15:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:29,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:29,197 INFO L87 Difference]: Start difference. First operand 1000 states and 1419 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:29,421 INFO L93 Difference]: Finished difference Result 2191 states and 3161 transitions. [2022-03-20 17:15:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-03-20 17:15:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:29,426 INFO L225 Difference]: With dead ends: 2191 [2022-03-20 17:15:29,426 INFO L226 Difference]: Without dead ends: 1196 [2022-03-20 17:15:29,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:29,428 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 238 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:29,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 204 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-03-20 17:15:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1156. [2022-03-20 17:15:29,480 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-20 17:15:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1659 transitions. [2022-03-20 17:15:29,483 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1659 transitions. Word has length 169 [2022-03-20 17:15:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:29,483 INFO L478 AbstractCegarLoop]: Abstraction has 1156 states and 1659 transitions. [2022-03-20 17:15:29,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1659 transitions. [2022-03-20 17:15:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-03-20 17:15:29,485 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:29,485 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:29,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 17:15:29,486 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 1 times [2022-03-20 17:15:29,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [692420979] [2022-03-20 17:15:29,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 671376038, now seen corresponding path program 2 times [2022-03-20 17:15:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316741219] [2022-03-20 17:15:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-03-20 17:15:29,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:29,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316741219] [2022-03-20 17:15:29,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316741219] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:29,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [692420979] [2022-03-20 17:15:29,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [692420979] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833304491] [2022-03-20 17:15:29,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:29,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:29,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:29,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:29,530 INFO L87 Difference]: Start difference. First operand 1156 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:29,733 INFO L93 Difference]: Finished difference Result 2405 states and 3431 transitions. [2022-03-20 17:15:29,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:29,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 205 [2022-03-20 17:15:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:29,737 INFO L225 Difference]: With dead ends: 2405 [2022-03-20 17:15:29,737 INFO L226 Difference]: Without dead ends: 1262 [2022-03-20 17:15:29,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:29,742 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:29,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 193 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2022-03-20 17:15:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1248. [2022-03-20 17:15:29,804 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-20 17:15:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1771 transitions. [2022-03-20 17:15:29,808 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1771 transitions. Word has length 205 [2022-03-20 17:15:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:29,808 INFO L478 AbstractCegarLoop]: Abstraction has 1248 states and 1771 transitions. [2022-03-20 17:15:29,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1771 transitions. [2022-03-20 17:15:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-03-20 17:15:29,811 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:29,811 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:29,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 17:15:29,812 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 1 times [2022-03-20 17:15:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545625853] [2022-03-20 17:15:29,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1618228412, now seen corresponding path program 2 times [2022-03-20 17:15:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:29,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568050532] [2022-03-20 17:15:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2022-03-20 17:15:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:29,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568050532] [2022-03-20 17:15:29,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568050532] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:29,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545625853] [2022-03-20 17:15:29,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545625853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:29,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:29,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813119336] [2022-03-20 17:15:29,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:29,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:29,849 INFO L87 Difference]: Start difference. First operand 1248 states and 1771 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:30,058 INFO L93 Difference]: Finished difference Result 2595 states and 3673 transitions. [2022-03-20 17:15:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 226 [2022-03-20 17:15:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:30,063 INFO L225 Difference]: With dead ends: 2595 [2022-03-20 17:15:30,063 INFO L226 Difference]: Without dead ends: 1360 [2022-03-20 17:15:30,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:30,065 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:30,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 193 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-03-20 17:15:30,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1348. [2022-03-20 17:15:30,115 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-20 17:15:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1891 transitions. [2022-03-20 17:15:30,118 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1891 transitions. Word has length 226 [2022-03-20 17:15:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:30,119 INFO L478 AbstractCegarLoop]: Abstraction has 1348 states and 1891 transitions. [2022-03-20 17:15:30,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1891 transitions. [2022-03-20 17:15:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-03-20 17:15:30,122 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:30,122 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:30,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 17:15:30,122 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 1 times [2022-03-20 17:15:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032862733] [2022-03-20 17:15:30,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash 341161079, now seen corresponding path program 2 times [2022-03-20 17:15:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380800258] [2022-03-20 17:15:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-03-20 17:15:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380800258] [2022-03-20 17:15:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380800258] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032862733] [2022-03-20 17:15:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032862733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363585324] [2022-03-20 17:15:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:30,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:30,174 INFO L87 Difference]: Start difference. First operand 1348 states and 1891 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:30,402 INFO L93 Difference]: Finished difference Result 2803 states and 3925 transitions. [2022-03-20 17:15:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 250 [2022-03-20 17:15:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:30,407 INFO L225 Difference]: With dead ends: 2803 [2022-03-20 17:15:30,407 INFO L226 Difference]: Without dead ends: 1468 [2022-03-20 17:15:30,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:30,410 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 182 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:30,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-03-20 17:15:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1460. [2022-03-20 17:15:30,459 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-20 17:15:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2023 transitions. [2022-03-20 17:15:30,463 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2023 transitions. Word has length 250 [2022-03-20 17:15:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:30,463 INFO L478 AbstractCegarLoop]: Abstraction has 1460 states and 2023 transitions. [2022-03-20 17:15:30,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2023 transitions. [2022-03-20 17:15:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-03-20 17:15:30,466 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:30,466 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:30,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 17:15:30,467 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 1 times [2022-03-20 17:15:30,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250771321] [2022-03-20 17:15:30,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -243610571, now seen corresponding path program 2 times [2022-03-20 17:15:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:30,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988767599] [2022-03-20 17:15:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-03-20 17:15:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988767599] [2022-03-20 17:15:30,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988767599] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:30,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250771321] [2022-03-20 17:15:30,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250771321] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974448899] [2022-03-20 17:15:30,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:30,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:30,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:30,506 INFO L87 Difference]: Start difference. First operand 1460 states and 2023 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:30,752 INFO L93 Difference]: Finished difference Result 3043 states and 4225 transitions. [2022-03-20 17:15:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 250 [2022-03-20 17:15:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:30,757 INFO L225 Difference]: With dead ends: 3043 [2022-03-20 17:15:30,757 INFO L226 Difference]: Without dead ends: 1596 [2022-03-20 17:15:30,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:30,760 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:30,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 194 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-03-20 17:15:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1584. [2022-03-20 17:15:30,814 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-20 17:15:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2167 transitions. [2022-03-20 17:15:30,816 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2167 transitions. Word has length 250 [2022-03-20 17:15:30,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:30,816 INFO L478 AbstractCegarLoop]: Abstraction has 1584 states and 2167 transitions. [2022-03-20 17:15:30,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:30,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2167 transitions. [2022-03-20 17:15:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-03-20 17:15:30,820 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:30,820 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:30,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 17:15:30,820 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 1 times [2022-03-20 17:15:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385778418] [2022-03-20 17:15:30,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1220168023, now seen corresponding path program 2 times [2022-03-20 17:15:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:30,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583970749] [2022-03-20 17:15:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-03-20 17:15:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:30,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583970749] [2022-03-20 17:15:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583970749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385778418] [2022-03-20 17:15:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385778418] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:30,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:30,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:30,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381995566] [2022-03-20 17:15:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:30,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:30,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:30,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:30,862 INFO L87 Difference]: Start difference. First operand 1584 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:31,141 INFO L93 Difference]: Finished difference Result 4722 states and 6463 transitions. [2022-03-20 17:15:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:31,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 280 [2022-03-20 17:15:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:31,151 INFO L225 Difference]: With dead ends: 4722 [2022-03-20 17:15:31,151 INFO L226 Difference]: Without dead ends: 3151 [2022-03-20 17:15:31,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:31,155 INFO L913 BasicCegarLoop]: 326 mSDtfsCounter, 299 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:31,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 333 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-03-20 17:15:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3149. [2022-03-20 17:15:31,280 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-20 17:15:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4308 transitions. [2022-03-20 17:15:31,286 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4308 transitions. Word has length 280 [2022-03-20 17:15:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:31,286 INFO L478 AbstractCegarLoop]: Abstraction has 3149 states and 4308 transitions. [2022-03-20 17:15:31,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4308 transitions. [2022-03-20 17:15:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-03-20 17:15:31,291 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:31,292 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:31,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 17:15:31,292 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 1 times [2022-03-20 17:15:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791055406] [2022-03-20 17:15:31,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 635396373, now seen corresponding path program 2 times [2022-03-20 17:15:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718820475] [2022-03-20 17:15:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-03-20 17:15:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:31,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718820475] [2022-03-20 17:15:31,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718820475] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:31,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:31,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:31,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:31,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791055406] [2022-03-20 17:15:31,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791055406] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:31,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:31,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153385756] [2022-03-20 17:15:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:31,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:31,334 INFO L87 Difference]: Start difference. First operand 3149 states and 4308 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:31,651 INFO L93 Difference]: Finished difference Result 6585 states and 9043 transitions. [2022-03-20 17:15:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:31,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 280 [2022-03-20 17:15:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:31,661 INFO L225 Difference]: With dead ends: 6585 [2022-03-20 17:15:31,661 INFO L226 Difference]: Without dead ends: 3449 [2022-03-20 17:15:31,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:31,667 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:31,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 194 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-03-20 17:15:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3433. [2022-03-20 17:15:31,835 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-20 17:15:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 4632 transitions. [2022-03-20 17:15:31,840 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 4632 transitions. Word has length 280 [2022-03-20 17:15:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:31,841 INFO L478 AbstractCegarLoop]: Abstraction has 3433 states and 4632 transitions. [2022-03-20 17:15:31,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 4632 transitions. [2022-03-20 17:15:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2022-03-20 17:15:31,847 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:31,847 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:31,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 17:15:31,847 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:31,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 1 times [2022-03-20 17:15:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:31,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965873773] [2022-03-20 17:15:31,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1636229011, now seen corresponding path program 2 times [2022-03-20 17:15:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:31,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709090186] [2022-03-20 17:15:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-03-20 17:15:31,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709090186] [2022-03-20 17:15:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709090186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:31,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:31,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:31,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965873773] [2022-03-20 17:15:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965873773] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:31,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:31,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747493374] [2022-03-20 17:15:31,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:31,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:31,892 INFO L87 Difference]: Start difference. First operand 3433 states and 4632 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:32,179 INFO L93 Difference]: Finished difference Result 7001 states and 9459 transitions. [2022-03-20 17:15:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:32,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 304 [2022-03-20 17:15:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:32,191 INFO L225 Difference]: With dead ends: 7001 [2022-03-20 17:15:32,191 INFO L226 Difference]: Without dead ends: 3581 [2022-03-20 17:15:32,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:32,199 INFO L913 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-20 17:15:32,199 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:32,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-03-20 17:15:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3565. [2022-03-20 17:15:32,376 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-20 17:15:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4784 transitions. [2022-03-20 17:15:32,382 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4784 transitions. Word has length 304 [2022-03-20 17:15:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:32,382 INFO L478 AbstractCegarLoop]: Abstraction has 3565 states and 4784 transitions. [2022-03-20 17:15:32,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4784 transitions. [2022-03-20 17:15:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-03-20 17:15:32,389 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:32,389 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:32,389 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 17:15:32,389 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 1 times [2022-03-20 17:15:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:32,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1959623618] [2022-03-20 17:15:32,390 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1456115728, now seen corresponding path program 2 times [2022-03-20 17:15:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679469699] [2022-03-20 17:15:32,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:32,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-03-20 17:15:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:32,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679469699] [2022-03-20 17:15:32,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679469699] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:32,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:32,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1959623618] [2022-03-20 17:15:32,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1959623618] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:32,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:32,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592153818] [2022-03-20 17:15:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:32,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:32,433 INFO L87 Difference]: Start difference. First operand 3565 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:32,785 INFO L93 Difference]: Finished difference Result 7517 states and 10223 transitions. [2022-03-20 17:15:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:32,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 315 [2022-03-20 17:15:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:32,801 INFO L225 Difference]: With dead ends: 7517 [2022-03-20 17:15:32,801 INFO L226 Difference]: Without dead ends: 3965 [2022-03-20 17:15:32,808 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:32,808 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 232 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:32,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 194 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-03-20 17:15:32,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3877. [2022-03-20 17:15:32,993 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-20 17:15:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5152 transitions. [2022-03-20 17:15:33,003 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5152 transitions. Word has length 315 [2022-03-20 17:15:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:33,003 INFO L478 AbstractCegarLoop]: Abstraction has 3877 states and 5152 transitions. [2022-03-20 17:15:33,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5152 transitions. [2022-03-20 17:15:33,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2022-03-20 17:15:33,011 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:33,012 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:33,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 17:15:33,013 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 1 times [2022-03-20 17:15:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:33,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151947443] [2022-03-20 17:15:33,015 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874766, now seen corresponding path program 2 times [2022-03-20 17:15:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077906526] [2022-03-20 17:15:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-03-20 17:15:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077906526] [2022-03-20 17:15:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077906526] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:33,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:33,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:33,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151947443] [2022-03-20 17:15:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151947443] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:33,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:33,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566645760] [2022-03-20 17:15:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:33,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:33,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:33,058 INFO L87 Difference]: Start difference. First operand 3877 states and 5152 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:33,370 INFO L93 Difference]: Finished difference Result 8149 states and 10767 transitions. [2022-03-20 17:15:33,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:33,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 329 [2022-03-20 17:15:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:33,379 INFO L225 Difference]: With dead ends: 8149 [2022-03-20 17:15:33,380 INFO L226 Difference]: Without dead ends: 4285 [2022-03-20 17:15:33,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:33,386 INFO L913 BasicCegarLoop]: 185 mSDtfsCounter, 279 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:33,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 192 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2022-03-20 17:15:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3997. [2022-03-20 17:15:33,543 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-20 17:15:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 5296 transitions. [2022-03-20 17:15:33,548 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 5296 transitions. Word has length 329 [2022-03-20 17:15:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:33,548 INFO L478 AbstractCegarLoop]: Abstraction has 3997 states and 5296 transitions. [2022-03-20 17:15:33,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 5296 transitions. [2022-03-20 17:15:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-03-20 17:15:33,571 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:33,572 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:33,572 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 17:15:33,572 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 1 times [2022-03-20 17:15:33,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:33,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295869785] [2022-03-20 17:15:33,574 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1272239000, now seen corresponding path program 2 times [2022-03-20 17:15:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:33,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315041067] [2022-03-20 17:15:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2022-03-20 17:15:33,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:33,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315041067] [2022-03-20 17:15:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315041067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:33,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:33,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:33,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:33,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295869785] [2022-03-20 17:15:33,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295869785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:33,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:33,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111301021] [2022-03-20 17:15:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:33,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:33,652 INFO L87 Difference]: Start difference. First operand 3997 states and 5296 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:34,116 INFO L93 Difference]: Finished difference Result 11461 states and 15262 transitions. [2022-03-20 17:15:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 330 [2022-03-20 17:15:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:34,128 INFO L225 Difference]: With dead ends: 11461 [2022-03-20 17:15:34,128 INFO L226 Difference]: Without dead ends: 7477 [2022-03-20 17:15:34,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:34,133 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 261 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:34,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 324 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2022-03-20 17:15:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7475. [2022-03-20 17:15:34,459 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-20 17:15:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7475 states to 7475 states and 9958 transitions. [2022-03-20 17:15:34,469 INFO L78 Accepts]: Start accepts. Automaton has 7475 states and 9958 transitions. Word has length 330 [2022-03-20 17:15:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:34,469 INFO L478 AbstractCegarLoop]: Abstraction has 7475 states and 9958 transitions. [2022-03-20 17:15:34,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 7475 states and 9958 transitions. [2022-03-20 17:15:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2022-03-20 17:15:34,477 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:34,477 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:34,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 17:15:34,478 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 1 times [2022-03-20 17:15:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:34,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934628582] [2022-03-20 17:15:34,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:34,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1394133645, now seen corresponding path program 2 times [2022-03-20 17:15:34,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:34,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943065999] [2022-03-20 17:15:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2022-03-20 17:15:34,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:34,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943065999] [2022-03-20 17:15:34,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943065999] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:34,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:34,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:34,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:34,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934628582] [2022-03-20 17:15:34,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934628582] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:34,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:34,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:34,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060931708] [2022-03-20 17:15:34,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:34,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:34,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:34,526 INFO L87 Difference]: Start difference. First operand 7475 states and 9958 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:35,040 INFO L93 Difference]: Finished difference Result 14945 states and 19891 transitions. [2022-03-20 17:15:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 331 [2022-03-20 17:15:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:35,057 INFO L225 Difference]: With dead ends: 14945 [2022-03-20 17:15:35,057 INFO L226 Difference]: Without dead ends: 7483 [2022-03-20 17:15:35,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:35,071 INFO L913 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:35,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 193 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2022-03-20 17:15:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7451. [2022-03-20 17:15:35,397 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-20 17:15:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7451 states to 7451 states and 9678 transitions. [2022-03-20 17:15:35,405 INFO L78 Accepts]: Start accepts. Automaton has 7451 states and 9678 transitions. Word has length 331 [2022-03-20 17:15:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:35,406 INFO L478 AbstractCegarLoop]: Abstraction has 7451 states and 9678 transitions. [2022-03-20 17:15:35,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7451 states and 9678 transitions. [2022-03-20 17:15:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-03-20 17:15:35,413 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:35,413 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:35,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-20 17:15:35,414 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:35,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 1 times [2022-03-20 17:15:35,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:35,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206255014] [2022-03-20 17:15:35,415 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1780616869, now seen corresponding path program 2 times [2022-03-20 17:15:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:35,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047508724] [2022-03-20 17:15:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:35,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2022-03-20 17:15:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:35,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047508724] [2022-03-20 17:15:35,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047508724] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 17:15:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39965479] [2022-03-20 17:15:35,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 17:15:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 17:15:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:35,475 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-20 17:15:35,492 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-20 17:15:35,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 17:15:35,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 17:15:35,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-20 17:15:35,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 17:15:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2022-03-20 17:15:36,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 17:15:36,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39965479] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:36,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 17:15:36,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-03-20 17:15:36,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:36,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206255014] [2022-03-20 17:15:36,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206255014] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:36,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:36,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 17:15:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287122392] [2022-03-20 17:15:36,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:36,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 17:15:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 17:15:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-20 17:15:36,108 INFO L87 Difference]: Start difference. First operand 7451 states and 9678 transitions. Second operand has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:36,887 INFO L93 Difference]: Finished difference Result 15067 states and 19580 transitions. [2022-03-20 17:15:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 17:15:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 354 [2022-03-20 17:15:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:36,901 INFO L225 Difference]: With dead ends: 15067 [2022-03-20 17:15:36,901 INFO L226 Difference]: Without dead ends: 7601 [2022-03-20 17:15:36,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-20 17:15:36,914 INFO L913 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-20 17:15:36,914 INFO L914 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-20 17:15:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7601 states. [2022-03-20 17:15:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7601 to 7457. [2022-03-20 17:15:37,268 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-20 17:15:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 9686 transitions. [2022-03-20 17:15:37,276 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 9686 transitions. Word has length 354 [2022-03-20 17:15:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:37,276 INFO L478 AbstractCegarLoop]: Abstraction has 7457 states and 9686 transitions. [2022-03-20 17:15:37,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 9686 transitions. [2022-03-20 17:15:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2022-03-20 17:15:37,284 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:37,284 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:37,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-20 17:15:37,501 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-20 17:15:37,501 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:37,502 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 1 times [2022-03-20 17:15:37,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150791635] [2022-03-20 17:15:37,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 640055986, now seen corresponding path program 2 times [2022-03-20 17:15:37,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:37,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987495174] [2022-03-20 17:15:37,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-20 17:15:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:37,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987495174] [2022-03-20 17:15:37,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987495174] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 17:15:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622848806] [2022-03-20 17:15:37,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 17:15:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 17:15:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:37,559 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-20 17:15:37,607 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-20 17:15:37,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 17:15:37,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 17:15:37,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 17:15:37,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 17:15:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-20 17:15:38,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 17:15:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2022-03-20 17:15:38,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622848806] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 17:15:38,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 17:15:38,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-20 17:15:38,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:38,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150791635] [2022-03-20 17:15:38,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150791635] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:38,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:38,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 17:15:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556368585] [2022-03-20 17:15:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:38,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 17:15:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:38,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 17:15:38,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 17:15:38,606 INFO L87 Difference]: Start difference. First operand 7457 states and 9686 transitions. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:39,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:39,708 INFO L93 Difference]: Finished difference Result 14825 states and 19252 transitions. [2022-03-20 17:15:39,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 17:15:39,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 367 [2022-03-20 17:15:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:39,727 INFO L225 Difference]: With dead ends: 14825 [2022-03-20 17:15:39,728 INFO L226 Difference]: Without dead ends: 11185 [2022-03-20 17:15:39,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 737 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-03-20 17:15:39,737 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 336 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:39,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 374 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 17:15:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2022-03-20 17:15:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 8561. [2022-03-20 17:15:40,272 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-20 17:15:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8561 states to 8561 states and 11182 transitions. [2022-03-20 17:15:40,282 INFO L78 Accepts]: Start accepts. Automaton has 8561 states and 11182 transitions. Word has length 367 [2022-03-20 17:15:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:40,283 INFO L478 AbstractCegarLoop]: Abstraction has 8561 states and 11182 transitions. [2022-03-20 17:15:40,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 4 states have internal predecessors, (184), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8561 states and 11182 transitions. [2022-03-20 17:15:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-03-20 17:15:40,290 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:40,291 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 17:15:40,310 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-20 17:15:40,507 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-20 17:15:40,507 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 3 times [2022-03-20 17:15:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:40,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980526154] [2022-03-20 17:15:40,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:40,509 INFO L85 PathProgramCache]: Analyzing trace with hash 101382063, now seen corresponding path program 4 times [2022-03-20 17:15:40,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:40,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085616152] [2022-03-20 17:15:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-20 17:15:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085616152] [2022-03-20 17:15:40,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085616152] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 17:15:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983899155] [2022-03-20 17:15:40,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 17:15:40,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 17:15:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:40,612 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-20 17:15:40,613 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-20 17:15:40,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 17:15:40,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 17:15:40,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 17:15:40,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 17:15:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-20 17:15:41,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 17:15:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-03-20 17:15:41,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983899155] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 17:15:41,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 17:15:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-20 17:15:41,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:41,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980526154] [2022-03-20 17:15:41,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980526154] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:41,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:41,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 17:15:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371221035] [2022-03-20 17:15:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:41,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 17:15:41,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 17:15:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-20 17:15:41,713 INFO L87 Difference]: Start difference. First operand 8561 states and 11182 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:42,684 INFO L93 Difference]: Finished difference Result 19299 states and 25058 transitions. [2022-03-20 17:15:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 17:15:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 380 [2022-03-20 17:15:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:42,704 INFO L225 Difference]: With dead ends: 19299 [2022-03-20 17:15:42,704 INFO L226 Difference]: Without dead ends: 10749 [2022-03-20 17:15:42,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-20 17:15:42,722 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 494 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:42,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 214 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 17:15:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2022-03-20 17:15:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 8599. [2022-03-20 17:15:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8599 states, 8594 states have (on average 1.2754247149173843) internal successors, (10961), 8594 states have internal predecessors, (10961), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8599 states to 8599 states and 10965 transitions. [2022-03-20 17:15:43,250 INFO L78 Accepts]: Start accepts. Automaton has 8599 states and 10965 transitions. Word has length 380 [2022-03-20 17:15:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:43,250 INFO L478 AbstractCegarLoop]: Abstraction has 8599 states and 10965 transitions. [2022-03-20 17:15:43,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 4 states have internal predecessors, (188), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8599 states and 10965 transitions. [2022-03-20 17:15:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2022-03-20 17:15:43,262 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:43,262 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 17:15:43,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-20 17:15:43,479 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-20 17:15:43,480 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 1 times [2022-03-20 17:15:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:43,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1304412566] [2022-03-20 17:15:43,482 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 617327076, now seen corresponding path program 2 times [2022-03-20 17:15:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:43,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593766968] [2022-03-20 17:15:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-03-20 17:15:43,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593766968] [2022-03-20 17:15:43,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593766968] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:43,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:43,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:43,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:43,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1304412566] [2022-03-20 17:15:43,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1304412566] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:43,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:43,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:15:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764108972] [2022-03-20 17:15:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:43,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:15:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:15:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:15:43,560 INFO L87 Difference]: Start difference. First operand 8599 states and 10965 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:44,203 INFO L93 Difference]: Finished difference Result 16055 states and 19918 transitions. [2022-03-20 17:15:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:15:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 419 [2022-03-20 17:15:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:44,211 INFO L225 Difference]: With dead ends: 16055 [2022-03-20 17:15:44,211 INFO L226 Difference]: Without dead ends: 3851 [2022-03-20 17:15:44,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:15:44,235 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:44,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 195 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:15:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2022-03-20 17:15:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3661. [2022-03-20 17:15:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3661 states, 3656 states have (on average 1.2464442013129102) internal successors, (4557), 3656 states have internal predecessors, (4557), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3661 states to 3661 states and 4561 transitions. [2022-03-20 17:15:44,437 INFO L78 Accepts]: Start accepts. Automaton has 3661 states and 4561 transitions. Word has length 419 [2022-03-20 17:15:44,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:44,438 INFO L478 AbstractCegarLoop]: Abstraction has 3661 states and 4561 transitions. [2022-03-20 17:15:44,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3661 states and 4561 transitions. [2022-03-20 17:15:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2022-03-20 17:15:44,443 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:44,444 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:44,444 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-20 17:15:44,445 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 1 times [2022-03-20 17:15:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:44,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649733614] [2022-03-20 17:15:44,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash 421546763, now seen corresponding path program 2 times [2022-03-20 17:15:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:44,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929402429] [2022-03-20 17:15:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-03-20 17:15:44,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929402429] [2022-03-20 17:15:44,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929402429] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 17:15:44,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060158980] [2022-03-20 17:15:44,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 17:15:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 17:15:44,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:44,532 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-20 17:15:44,591 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-20 17:15:44,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 17:15:44,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 17:15:44,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 17:15:44,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 17:15:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2022-03-20 17:15:45,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 17:15:45,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060158980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:45,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 17:15:45,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-20 17:15:45,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:45,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649733614] [2022-03-20 17:15:45,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649733614] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:45,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:45,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 17:15:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102580685] [2022-03-20 17:15:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:45,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 17:15:45,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 17:15:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 17:15:45,327 INFO L87 Difference]: Start difference. First operand 3661 states and 4561 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:45,647 INFO L93 Difference]: Finished difference Result 4076 states and 5041 transitions. [2022-03-20 17:15:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 17:15:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 517 [2022-03-20 17:15:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:45,652 INFO L225 Difference]: With dead ends: 4076 [2022-03-20 17:15:45,652 INFO L226 Difference]: Without dead ends: 3999 [2022-03-20 17:15:45,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 518 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 17:15:45,654 INFO L913 BasicCegarLoop]: 306 mSDtfsCounter, 56 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:45,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 462 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:15:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2022-03-20 17:15:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3586. [2022-03-20 17:15:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3581 states have (on average 1.246579167830215) internal successors, (4464), 3581 states have internal predecessors, (4464), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4468 transitions. [2022-03-20 17:15:45,894 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4468 transitions. Word has length 517 [2022-03-20 17:15:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:45,895 INFO L478 AbstractCegarLoop]: Abstraction has 3586 states and 4468 transitions. [2022-03-20 17:15:45,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4468 transitions. [2022-03-20 17:15:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2022-03-20 17:15:45,900 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:15:45,901 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:15:45,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-20 17:15:46,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-20 17:15:46,113 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:15:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:15:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 1 times [2022-03-20 17:15:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:46,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024840890] [2022-03-20 17:15:46,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:15:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -806626322, now seen corresponding path program 2 times [2022-03-20 17:15:46,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:15:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217529567] [2022-03-20 17:15:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:15:46,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:15:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:46,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:15:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:15:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-20 17:15:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:15:46,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217529567] [2022-03-20 17:15:46,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217529567] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 17:15:46,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911057285] [2022-03-20 17:15:46,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 17:15:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 17:15:46,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:15:46,301 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-20 17:15:46,301 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-20 17:15:46,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 17:15:46,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 17:15:46,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2022-03-20 17:15:46,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 17:15:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-20 17:15:47,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 17:15:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2022-03-20 17:15:47,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911057285] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 17:15:47,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 17:15:47,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-03-20 17:15:47,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:15:47,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024840890] [2022-03-20 17:15:47,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024840890] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:15:47,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:15:47,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 17:15:47,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758313558] [2022-03-20 17:15:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:15:47,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 17:15:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:15:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 17:15:47,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-20 17:15:47,886 INFO L87 Difference]: Start difference. First operand 3586 states and 4468 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:15:48,166 INFO L93 Difference]: Finished difference Result 4428 states and 5511 transitions. [2022-03-20 17:15:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 17:15:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 629 [2022-03-20 17:15:48,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:15:48,167 INFO L225 Difference]: With dead ends: 4428 [2022-03-20 17:15:48,167 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 17:15:48,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1267 GetRequests, 1258 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-20 17:15:48,201 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 202 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 17:15:48,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 237 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 17:15:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 17:15:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 17:15:48,204 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-20 17:15:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 17:15:48,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 629 [2022-03-20 17:15:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:15:48,205 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 17:15:48,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:15:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 17:15:48,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 17:15:48,207 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 17:15:48,226 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-20 17:15:48,410 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-20 17:15:48,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 17:16:59,672 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-03-20 17:16:59,673 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-03-20 17:16:59,673 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-03-20 17:16:59,673 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 564 574) the Hoare annotation is: true [2022-03-20 17:16:59,677 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 564 574) the Hoare annotation is: true [2022-03-20 17:16:59,677 INFO L878 garLoopResultBuilder]: At program point L570(line 570) the Hoare annotation is: (<= 12292 main_~s~0) [2022-03-20 17:16:59,677 INFO L885 garLoopResultBuilder]: At program point L570-1(line 570) the Hoare annotation is: true [2022-03-20 17:16:59,678 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 564 574) the Hoare annotation is: true [2022-03-20 17:16:59,678 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,678 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-20 17:16:59,678 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,679 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 403) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,679 INFO L878 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-20 17:16:59,679 INFO L878 garLoopResultBuilder]: At program point L399-2(lines 213 496) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,679 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-20 17:16:59,679 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-20 17:16:59,679 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 548) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,680 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,680 INFO L878 garLoopResultBuilder]: At program point L368(lines 368 370) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,680 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 337) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,681 INFO L878 garLoopResultBuilder]: At program point L302(lines 302 304) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,681 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-20 17:16:59,694 INFO L878 garLoopResultBuilder]: At program point L302-2(lines 300 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)))) [2022-03-20 17:16:59,695 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 501) the Hoare annotation is: (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (not .cse3) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= 4432 ssl3_connect_~s__state~0) .cse1) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse0) (and .cse4 .cse1 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,695 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 512) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-20 17:16:59,696 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 523) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-03-20 17:16:59,696 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-20 17:16:59,697 INFO L878 garLoopResultBuilder]: At program point L534(lines 534 539) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,697 INFO L878 garLoopResultBuilder]: At program point L534-2(lines 533 547) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,697 INFO L878 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,697 INFO L878 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,697 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-20 17:16:59,697 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 538) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 500) the Hoare annotation is: (let ((.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= 3 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (<= 4432 ssl3_connect_~s__state~0) (and .cse1 (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse3 .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 511) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 522) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and .cse17 .cse2)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L372-2(lines 372 377) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~blastFlag~0 0)) (.cse3 (= 4496 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (= 4512 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse4 .cse3) (and .cse4 .cse2) (and .cse1 .cse3 .cse5) (and .cse1 .cse2 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,698 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-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,698 INFO L885 garLoopResultBuilder]: At program point L472-1(lines 472 474) the Hoare annotation is: true [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L274(lines 274 276) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384))) [2022-03-20 17:16:59,698 INFO L885 garLoopResultBuilder]: At program point L209(lines 209 499) the Hoare annotation is: true [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 510) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-20 17:16:59,698 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 521) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L110-1(lines 87 562) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L408(lines 408 411) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (= ssl3_connect_~s__state~0 4528))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,699 INFO L885 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 545) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 445) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 346) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,699 INFO L885 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-03-20 17:16:59,699 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 509) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 520) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse15 (= 3 ssl3_connect_~s__state~0)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4416)) (.cse13 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse12 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse13) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse14 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse14 .cse15 .cse2 .cse4) (and .cse12 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse15) (and .cse16 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse14 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse12 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse13 .cse6) (and .cse16 .cse4 .cse6) (and .cse16 .cse2)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 531) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,700 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-20 17:16:59,700 INFO L885 garLoopResultBuilder]: At program point L478(lines 478 480) the Hoare annotation is: true [2022-03-20 17:16:59,700 INFO L885 garLoopResultBuilder]: At program point L478-2(lines 478 480) the Hoare annotation is: true [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L446(lines 446 450) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L446-2(lines 446 450) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (= ssl3_connect_~blastFlag~0 0)) (.cse0 (= 3 ssl3_connect_~s__state~0)) (.cse1 (= 2 ssl3_connect_~blastFlag~0)) (.cse4 (not .cse2)) (.cse5 (= 4512 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse2) (and .cse1 .cse4 .cse5)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L347(lines 347 351) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L281(lines 281 283) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,700 INFO L878 garLoopResultBuilder]: At program point L347-2(lines 347 351) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__state~0 4464)) (.cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse4 (= ssl3_connect_~blastFlag~0 0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__cert_req~0 0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse6 (= ssl3_connect_~s__state~0 4480)) (.cse3 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2) (and .cse5 .cse0 .cse1 .cse6) (and .cse5 .cse4 .cse6) (and .cse5 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L281-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 508) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse11 (= 3 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse9 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse10) (and .cse9 .cse11 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse11) (and .cse12 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse9 .cse4 .cse5 .cse8) (and .cse12 .cse5 .cse10) (and .cse12 .cse2)))) [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 519) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 530) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,703 INFO L885 garLoopResultBuilder]: At program point ssl3_connectENTRY(lines 22 563) the Hoare annotation is: true [2022-03-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L316(lines 316 318) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,703 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-20 17:16:59,703 INFO L878 garLoopResultBuilder]: At program point L316-2(lines 213 496) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L416(lines 416 418) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L383(lines 383 385) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,704 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-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 507) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 518) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 529) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,704 INFO L885 garLoopResultBuilder]: At program point L484(lines 484 486) the Hoare annotation is: true [2022-03-20 17:16:59,704 INFO L885 garLoopResultBuilder]: At program point L484-2(lines 484 486) the Hoare annotation is: true [2022-03-20 17:16:59,704 INFO L885 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L287(lines 287 291) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,704 INFO L878 garLoopResultBuilder]: At program point L287-2(lines 287 291) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse4 (= 4400 ssl3_connect_~s__state~0)) (.cse6 (= ssl3_connect_~blastFlag~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse4 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse4 .cse2 .cse5) (and .cse0 .cse1 .cse6 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse4 .cse6 .cse5)))) [2022-03-20 17:16:59,719 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 506) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse9 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~blastFlag~0 4)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse7) (and .cse8 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse8 .cse9 .cse2 .cse5) (and .cse5 .cse6 .cse10) (and .cse4 .cse9) (and .cse11 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5 .cse7) (and .cse11 .cse5 .cse10) (and .cse11 .cse2)))) [2022-03-20 17:16:59,719 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 517) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-20 17:16:59,719 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 528) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,719 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,719 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-20 17:16:59,719 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-20 17:16:59,719 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 505) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 516) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse14 (= 3 ssl3_connect_~s__state~0)) (.cse13 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse12 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse15 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse11) (and .cse7 .cse4 .cse12) (and .cse4 .cse10 .cse6) (and .cse13 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse13 .cse14 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse14) (and .cse15 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse13 .cse7 .cse4 .cse11) (and .cse7 .cse4 .cse5) (and .cse4 .cse12 .cse6) (and .cse15 .cse4 .cse6) (and .cse15 .cse2)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 527) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,720 INFO L885 garLoopResultBuilder]: At program point ssl3_connectEXIT(lines 22 563) the Hoare annotation is: true [2022-03-20 17:16:59,720 INFO L885 garLoopResultBuilder]: At program point L489(lines 489 491) the Hoare annotation is: true [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L456(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L423(lines 423 437) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352))) (or (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L423-1(lines 423 437) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse2 (not .cse5)) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 (= 3 ssl3_connect_~s__state~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L456-2(lines 456 467) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L324(lines 324 327) the Hoare annotation is: (let ((.cse0 (= 4432 ssl3_connect_~s__state~0))) (or (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and (= ssl3_connect_~blastFlag~0 0) .cse0) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,720 INFO L885 garLoopResultBuilder]: At program point ssl3_connectFINAL(lines 22 563) the Hoare annotation is: true [2022-03-20 17:16:59,720 INFO L885 garLoopResultBuilder]: At program point L556(lines 556 558) the Hoare annotation is: true [2022-03-20 17:16:59,720 INFO L885 garLoopResultBuilder]: At program point L556-2(lines 556 558) the Hoare annotation is: true [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L359(lines 359 361) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 504) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (and .cse9 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6) (and .cse9 .cse5 (<= ssl3_connect_~blastFlag~0 4)) (and .cse9 .cse2)))) [2022-03-20 17:16:59,720 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 515) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-03-20 17:16:59,721 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 526) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-20 17:16:59,721 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 395) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,721 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-20 17:16:59,721 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,721 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-20 17:16:59,721 INFO L878 garLoopResultBuilder]: At program point L427(lines 427 433) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (not (= ssl3_connect_~s__hit~0 0))) (.cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0) .cse2 .cse3) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2 .cse3) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,721 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 268) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-20 17:16:59,722 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-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 464) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) (not .cse2) (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 503) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-03-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 514) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse13 (= 3 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse4 .cse5 .cse8) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse9) (and .cse4 .cse5 .cse10) (and .cse5 .cse8 .cse11) (and .cse12 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse13) (and .cse14 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse12 .cse4 .cse5 .cse9) (and .cse5 .cse10 .cse11) (and .cse14 .cse5 .cse11) (and .cse14 .cse2)))) [2022-03-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 525) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0)) (and .cse0 .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2))) [2022-03-20 17:16:59,722 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-20 17:16:59,722 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-20 17:16:59,722 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-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 267) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2022-03-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 298 308) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 (= 3 ssl3_connect_~blastFlag~0) .cse1 .cse2) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= 2 ssl3_connect_~blastFlag~0) .cse2))) [2022-03-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L265-2(lines 213 496) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~blastFlag~0 1) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2022-03-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse4)) (.cse11 (= ssl3_connect_~s__state~0 4464)) (.cse10 (= 4496 ssl3_connect_~s__state~0)) (.cse16 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse12 (= 4400 ssl3_connect_~s__state~0)) (.cse9 (= 4512 ssl3_connect_~s__state~0)) (.cse7 (= 3 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse14 (= ssl3_connect_~s__state~0 4416)) (.cse15 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse18 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse2 .cse4) (and .cse8 .cse4 .cse9) (and .cse8 .cse4 .cse10) (and .cse8 .cse4 .cse11) (and .cse8 .cse12 .cse4 .cse6) (and .cse2 .cse9) (and .cse0 .cse8 .cse1 .cse4 .cse13) (and .cse14 .cse8 .cse4 .cse6) (and .cse8 .cse4 .cse15) (and .cse16 .cse17 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse4 .cse11 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse10 .cse6) (and .cse16 .cse17 .cse8 .cse4 .cse13) (and .cse12 .cse2 .cse4) (and .cse14 .cse2 .cse4) (and .cse4 .cse9 .cse6) (and .cse8 .cse7) (and .cse18 .cse8 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse8 .cse4 .cse5) (and .cse14 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse15 .cse6) (and .cse18 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse18 .cse2)))) [2022-03-20 17:16:59,723 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 334) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (and .cse0 .cse1 (= ssl3_connect_~blastFlag~0 0)) (not (<= 12292 |ssl3_connect_#in~initial_state|)))) [2022-03-20 17:16:59,724 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 502) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse2 (= 2 ssl3_connect_~blastFlag~0)) (.cse8 (= 3 ssl3_connect_~s__state~0)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse6 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5 .cse6) (and .cse7 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse8 .cse2 .cse5) (and .cse4 .cse8) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse7 .cse4 .cse5 .cse6)))) [2022-03-20 17:16:59,724 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 513) the Hoare annotation is: (let ((.cse5 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (not .cse5)) (.cse7 (= 4496 ssl3_connect_~s__state~0)) (.cse6 (= 4512 ssl3_connect_~s__state~0)) (.cse12 (= 3 ssl3_connect_~s__state~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (= ssl3_connect_~s__state~0 4480)) (.cse11 (<= ssl3_connect_~blastFlag~0 4)) (.cse13 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse5 .cse7) (and .cse2 .cse6) (and .cse0 .cse4 .cse1 .cse5 .cse8) (and .cse4 .cse5 .cse9) (and .cse10 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse5 .cse7 .cse11) (and .cse10 .cse12 .cse2 .cse5) (and .cse5 .cse6 .cse11) (and .cse4 .cse12) (and .cse13 .cse4 .cse5) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse10 .cse4 .cse5 .cse8) (and .cse5 .cse9 .cse11) (and .cse13 .cse5 .cse11) (and .cse13 .cse2)))) [2022-03-20 17:16:59,724 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 524) the Hoare annotation is: (let ((.cse4 (= ssl3_connect_~s__hit~0 0))) (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (= ssl3_connect_~s__state~0 4464)) (.cse3 (not .cse4)) (.cse9 (= 4496 ssl3_connect_~s__state~0)) (.cse11 (= 4400 ssl3_connect_~s__state~0)) (.cse8 (= 4512 ssl3_connect_~s__state~0)) (.cse16 (= 3 ssl3_connect_~s__state~0)) (.cse15 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (= ssl3_connect_~s__state~0 4416)) (.cse14 (= ssl3_connect_~s__state~0 4480)) (.cse6 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= 2 ssl3_connect_~blastFlag~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse7 .cse4 .cse8) (and .cse7 .cse4 .cse9) (and .cse7 .cse4 .cse10) (and .cse7 .cse11 .cse4 .cse6) (and .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse13 .cse7 .cse4 .cse6) (and .cse7 .cse4 .cse14) (and .cse4 .cse10 .cse6) (and (= 4432 ssl3_connect_~s__state~0) .cse4 .cse6) (and .cse15 .cse2 .cse3 (= 3 ssl3_connect_~s__s3__tmp__next_state___0~0)) (= ssl3_connect_~blastFlag~0 0) (and .cse4 .cse9 .cse6) (and .cse15 .cse16 .cse2 .cse4) (and .cse11 .cse2 .cse4) (and .cse13 .cse2 .cse4) (and .cse4 .cse8 .cse6) (and .cse7 .cse16) (and .cse17 .cse7 .cse4) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse15 .cse7 .cse4 .cse12) (and .cse7 .cse4 .cse5) (and .cse13 (= 3 ssl3_connect_~blastFlag~0) .cse4) (and .cse4 .cse14 .cse6) (and .cse17 .cse4 .cse6) (and (= ssl3_connect_~blastFlag~0 1) (= ssl3_connect_~s__state~0 4384)) (and .cse17 .cse2)))) [2022-03-20 17:16:59,724 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,724 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,724 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,724 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:16:59,728 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-20 17:16:59,729 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 17:16:59,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 05:16:59 BoogieIcfgContainer [2022-03-20 17:16:59,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 17:16:59,765 INFO L158 Benchmark]: Toolchain (without parser) took 94864.92ms. Allocated memory was 215.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 162.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-20 17:16:59,765 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 17:16:59,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.42ms. Allocated memory is still 215.0MB. Free memory was 162.0MB in the beginning and 186.5MB in the end (delta: -24.5MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2022-03-20 17:16:59,765 INFO L158 Benchmark]: Boogie Preprocessor took 54.73ms. Allocated memory is still 215.0MB. Free memory was 186.5MB in the beginning and 184.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-20 17:16:59,765 INFO L158 Benchmark]: RCFGBuilder took 484.12ms. Allocated memory is still 215.0MB. Free memory was 184.1MB in the beginning and 159.3MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-03-20 17:16:59,765 INFO L158 Benchmark]: TraceAbstraction took 94037.17ms. Allocated memory was 215.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 158.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-03-20 17:16:59,766 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.10ms. Allocated memory is still 215.0MB. Free memory is still 178.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.42ms. Allocated memory is still 215.0MB. Free memory was 162.0MB in the beginning and 186.5MB in the end (delta: -24.5MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.73ms. Allocated memory is still 215.0MB. Free memory was 186.5MB in the beginning and 184.1MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 484.12ms. Allocated memory is still 215.0MB. Free memory was 184.1MB in the beginning and 159.3MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 94037.17ms. Allocated memory was 215.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 158.6MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 560]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.0s, OverallIterations: 28, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 71.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6895 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6893 mSDsluCounter, 6564 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5703 IncrementalHoareTripleChecker+Invalid, 6244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 541 mSolverCounterUnsat, 5975 mSDtfsCounter, 5703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3823 GetRequests, 3719 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8599occurred in iteration=25, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 6119 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 137 LocationsWithAnnotation, 137 PreInvPairs, 5003 NumberOfFragments, 11504 HoareAnnotationTreeSize, 137 FomulaSimplifications, 121856 FormulaSimplificationTreeSizeReduction, 25.6s HoareSimplificationTime, 137 FomulaSimplificationsInter, 228919 FormulaSimplificationTreeSizeReductionInter, 45.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((s__hit == 0 && s__state == 4448) && blastFlag <= 4)) || ((3 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4512 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4496 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4464)) || (((s__s3__tmp__next_state___0 <= 4560 && 4400 == s__state) && s__hit == 0) && blastFlag <= 4)) || (2 == blastFlag && 4512 == s__state)) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((s__state == 4416 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0)) || ((s__hit == 0 && s__state == 4464) && blastFlag <= 4)) || ((4432 == s__state && s__hit == 0) && blastFlag <= 4)) || blastFlag == 0) || ((s__hit == 0 && 4496 == s__state) && blastFlag <= 4)) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((4400 == s__state && 2 == blastFlag) && s__hit == 0)) || ((s__state == 4416 && 2 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && 4512 == s__state) && blastFlag <= 4)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || ((s__state == 4528 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4448)) || ((s__state == 4416 && 3 == blastFlag) && s__hit == 0)) || ((s__hit == 0 && s__state == 4480) && blastFlag <= 4)) || ((s__state == 4528 && s__hit == 0) && blastFlag <= 4)) || (blastFlag == 1 && s__state == 4384)) || (s__state == 4528 && 2 == blastFlag) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (12292 <= s__state && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((4352 <= s__state && s__state <= 4560) && blastFlag == 0) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((4352 <= s__state && 3 == blastFlag) && s__state <= 4560) && s__hit == 0) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((4352 <= s__state && s__state <= 4352) && 2 == blastFlag) && !(s__hit == 0)) && 3 == s__s3__tmp__next_state___0) || ((4352 <= s__state && s__state <= 4352) && blastFlag == 0)) || ((((4352 <= s__state && s__state <= 4352) && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: blastFlag == 0 || !(12292 <= \old(initial_state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((4560 <= s__state && s__state <= 4560) && 2 == blastFlag) && !(s__hit == 0)) || ((((4560 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (4560 <= s__state && blastFlag == 0)) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && s__state <= 4560) && blastFlag == 0) || !(12292 <= \old(initial_state))) || ((((4352 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || (((4352 <= s__state && s__state <= 4560) && 2 == blastFlag) && s__hit == 0) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__state <= 4560) && 2 == blastFlag) || (((4432 <= s__state && s__state <= 4560) && s__hit == 0) && blastFlag <= 4)) || ((4432 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state))) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag == 1) && s__state <= 4560) || ((4352 <= s__state && s__state <= 4560) && blastFlag == 0)) || !(12292 <= \old(initial_state)) - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_connect Derived contract for procedure ssl3_connect: 1 - ProcedureContractResult [Line: 564]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-20 17:16:59,802 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...