/usr/bin/java -ea -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_srvr_12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:14:04,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:14:04,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:14:04,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:14:04,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:14:04,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:14:04,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:14:04,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:14:04,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:14:04,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:14:04,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:14:04,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:14:04,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:14:04,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:14:04,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:14:04,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:14:04,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:14:04,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:14:04,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:14:04,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:14:04,633 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:14:04,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:14:04,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:14:04,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:14:04,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:14:04,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:14:04,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:14:04,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:14:04,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:14:04,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:14:04,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:14:04,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:14:04,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:14:04,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:14:04,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:14:04,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:14:04,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:14:04,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:14:04,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:14:04,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:14:04,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:14:04,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:14:04,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:14:04,672 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:14:04,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:14:04,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:14:04,674 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:14:04,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:14:04,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:14:04,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:14:04,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:14:04,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:14:04,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:14:04,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:14:04,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:14:04,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:14:04,677 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:14:04,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:14:04,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:14:04,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:14:04,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:14:04,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:14:04,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c [2022-04-28 08:14:04,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23722ed4a/e2b574535cce4f3ca96acd46d01eb2ef/FLAGfb4bb570e [2022-04-28 08:14:05,377 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:14:05,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c [2022-04-28 08:14:05,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23722ed4a/e2b574535cce4f3ca96acd46d01eb2ef/FLAGfb4bb570e [2022-04-28 08:14:05,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23722ed4a/e2b574535cce4f3ca96acd46d01eb2ef [2022-04-28 08:14:05,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:14:05,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:14:05,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:14:05,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:14:05,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:14:05,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d830d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05, skipping insertion in model container [2022-04-28 08:14:05,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:14:05,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:14:05,752 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_srvr_12.cil.c[49672,49685] [2022-04-28 08:14:05,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:14:05,777 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:14:05,859 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_srvr_12.cil.c[49672,49685] [2022-04-28 08:14:05,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:14:05,879 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:14:05,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05 WrapperNode [2022-04-28 08:14:05,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:14:05,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:14:05,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:14:05,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:14:05,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:14:05,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:14:05,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:14:05,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:14:05,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (1/1) ... [2022-04-28 08:14:05,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:14:05,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:14:05,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:14:06,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:14:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:14:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:14:06,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:14:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:14:06,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:14:06,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:14:06,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:14:06,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:14:06,137 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:14:06,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:14:06,202 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:14:06,731 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-28 08:14:06,731 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-28 08:14:06,750 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:14:06,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:14:06,758 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:14:06,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:14:06 BoogieIcfgContainer [2022-04-28 08:14:06,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:14:06,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:14:06,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:14:06,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:14:06,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:14:05" (1/3) ... [2022-04-28 08:14:06,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee0af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:14:06, skipping insertion in model container [2022-04-28 08:14:06,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:14:05" (2/3) ... [2022-04-28 08:14:06,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee0af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:14:06, skipping insertion in model container [2022-04-28 08:14:06,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:14:06" (3/3) ... [2022-04-28 08:14:06,780 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2022-04-28 08:14:06,796 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:14:06,796 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:14:06,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:14:06,847 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6441fb71, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7449c5b5 [2022-04-28 08:14:06,847 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:14:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 168 states have (on average 1.75) internal successors, (294), 169 states have internal predecessors, (294), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:14:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:14:06,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:06,864 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2022-04-28 08:14:06,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:06,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:06,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 1 times [2022-04-28 08:14:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:06,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432009687] [2022-04-28 08:14:06,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 2 times [2022-04-28 08:14:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:06,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508163447] [2022-04-28 08:14:06,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:07,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-28 08:14:07,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-28 08:14:07,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-28 08:14:07,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:07,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {179#true} is VALID [2022-04-28 08:14:07,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-28 08:14:07,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-28 08:14:07,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret59 := main(); {179#true} is VALID [2022-04-28 08:14:07,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {184#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:07,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {184#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {185#(not (= 8480 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:07,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#(not (= 8480 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(0 != 12288 + ~tmp___1~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(0 == ~s__cert~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !false; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} ~state~0 := ~s__state~0; {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(12292 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(16384 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(8192 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(24576 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume !(8195 == ~s__state~0); {186#(not (= ssl3_accept_~s__state~0 8480))} is VALID [2022-04-28 08:14:07,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {186#(not (= ssl3_accept_~s__state~0 8480))} assume 8480 == ~s__state~0; {180#false} is VALID [2022-04-28 08:14:07,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {180#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {180#false} is VALID [2022-04-28 08:14:07,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {180#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {180#false} is VALID [2022-04-28 08:14:07,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {180#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {180#false} is VALID [2022-04-28 08:14:07,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {180#false} assume 0 == ~s__s3__tmp__reuse_message~0; {180#false} is VALID [2022-04-28 08:14:07,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {180#false} assume 0 == ~skip~0; {180#false} is VALID [2022-04-28 08:14:07,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {180#false} assume 8560 == ~state~0; {180#false} is VALID [2022-04-28 08:14:07,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {180#false} assume 8448 == ~s__state~0; {180#false} is VALID [2022-04-28 08:14:07,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {180#false} assume -1 != ~s__verify_mode~0; {180#false} is VALID [2022-04-28 08:14:07,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {180#false} assume -2 != ~s__verify_mode~0; {180#false} is VALID [2022-04-28 08:14:07,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {180#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {180#false} is VALID [2022-04-28 08:14:07,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {180#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {180#false} is VALID [2022-04-28 08:14:07,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {180#false} assume 4 != ~blastFlag~0; {180#false} is VALID [2022-04-28 08:14:07,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {180#false} assume 1024 != ~tmp___7~0; {180#false} is VALID [2022-04-28 08:14:07,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-28 08:14:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508163447] [2022-04-28 08:14:07,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508163447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:07,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:07,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:07,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:07,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432009687] [2022-04-28 08:14:07,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432009687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:07,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:07,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974856690] [2022-04-28 08:14:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 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) Word has length 34 [2022-04-28 08:14:07,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:07,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:07,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:07,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:07,342 INFO L87 Difference]: Start difference. First operand has 176 states, 168 states have (on average 1.75) internal successors, (294), 169 states have internal predecessors, (294), 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 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:08,732 INFO L93 Difference]: Finished difference Result 363 states and 624 transitions. [2022-04-28 08:14:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:08,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 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) Word has length 34 [2022-04-28 08:14:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-28 08:14:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-28 08:14:08,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 624 transitions. [2022-04-28 08:14:09,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:09,331 INFO L225 Difference]: With dead ends: 363 [2022-04-28 08:14:09,331 INFO L226 Difference]: Without dead ends: 180 [2022-04-28 08:14:09,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:09,340 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 862 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:09,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 258 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 08:14:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-28 08:14:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-04-28 08:14:09,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:09,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,405 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,406 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:09,414 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-28 08:14:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-28 08:14:09,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:09,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:09,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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) Second operand 180 states. [2022-04-28 08:14:09,417 INFO L87 Difference]: Start difference. First operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 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) Second operand 180 states. [2022-04-28 08:14:09,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:09,424 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-28 08:14:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-28 08:14:09,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:09,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:09,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:09,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.6127167630057804) internal successors, (279), 173 states have internal predecessors, (279), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 283 transitions. [2022-04-28 08:14:09,434 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 283 transitions. Word has length 34 [2022-04-28 08:14:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:09,435 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 283 transitions. [2022-04-28 08:14:09,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 283 transitions. [2022-04-28 08:14:09,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 283 transitions. [2022-04-28 08:14:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 08:14:09,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:09,706 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-28 08:14:09,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:14:09,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 1 times [2022-04-28 08:14:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:09,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1225887242] [2022-04-28 08:14:09,707 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 2 times [2022-04-28 08:14:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:09,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827698581] [2022-04-28 08:14:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:09,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {1646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-28 08:14:09,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-28 08:14:09,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-28 08:14:09,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {1638#true} call ULTIMATE.init(); {1646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:09,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {1646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1638#true} is VALID [2022-04-28 08:14:09,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-28 08:14:09,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-28 08:14:09,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret59 := main(); {1638#true} is VALID [2022-04-28 08:14:09,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {1638#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1643#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:09,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {1643#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {1644#(not (= 12292 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:09,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {1644#(not (= 12292 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume !false; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {1645#(not (= 12292 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:09,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#(not (= 12292 ssl3_accept_~s__state~0))} assume 12292 == ~s__state~0; {1639#false} is VALID [2022-04-28 08:14:09,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} ~s__new_session~0 := 1; {1639#false} is VALID [2022-04-28 08:14:09,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} ~s__server~0 := 1; {1639#false} is VALID [2022-04-28 08:14:09,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {1639#false} assume 0 != ~cb~0; {1639#false} is VALID [2022-04-28 08:14:09,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {1639#false} is VALID [2022-04-28 08:14:09,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {1639#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1639#false} is VALID [2022-04-28 08:14:09,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {1639#false} assume !(0 == ~s__init_buf___0~0); {1639#false} is VALID [2022-04-28 08:14:09,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {1639#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1639#false} is VALID [2022-04-28 08:14:09,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {1639#false} assume !(12292 != ~s__state~0);#t~post34 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post34;havoc #t~post34;~s__state~0 := 8480; {1639#false} is VALID [2022-04-28 08:14:09,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {1639#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {1639#false} is VALID [2022-04-28 08:14:09,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#false} assume 0 == ~s__s3__tmp__reuse_message~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#false} assume 0 == ~skip~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {1639#false} assume 8560 == ~state~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {1639#false} assume 8448 == ~s__state~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1639#false} assume -1 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1639#false} assume -2 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-28 08:14:09,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {1639#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {1639#false} is VALID [2022-04-28 08:14:09,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {1639#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {1639#false} is VALID [2022-04-28 08:14:09,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {1639#false} assume 4 != ~blastFlag~0; {1639#false} is VALID [2022-04-28 08:14:09,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {1639#false} assume 1024 != ~tmp___7~0; {1639#false} is VALID [2022-04-28 08:14:09,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-28 08:14:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:09,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827698581] [2022-04-28 08:14:09,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827698581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:09,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:09,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:09,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:09,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1225887242] [2022-04-28 08:14:09,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1225887242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:09,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:09,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:09,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658880476] [2022-04-28 08:14:09,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:09,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:09,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:09,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:09,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:09,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:09,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:09,866 INFO L87 Difference]: Start difference. First operand 178 states and 283 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:10,821 INFO L93 Difference]: Finished difference Result 364 states and 581 transitions. [2022-04-28 08:14:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-28 08:14:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-28 08:14:10,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 521 transitions. [2022-04-28 08:14:11,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 521 edges. 521 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:11,287 INFO L225 Difference]: With dead ends: 364 [2022-04-28 08:14:11,287 INFO L226 Difference]: Without dead ends: 200 [2022-04-28 08:14:11,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:11,293 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 766 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:11,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 197 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-28 08:14:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-28 08:14:11,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:11,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,328 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,328 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:11,339 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-28 08:14:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-28 08:14:11,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:11,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:11,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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) Second operand 200 states. [2022-04-28 08:14:11,346 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 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) Second operand 200 states. [2022-04-28 08:14:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:11,357 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-28 08:14:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-28 08:14:11,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:11,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:11,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:11,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.5846153846153845) internal successors, (309), 195 states have internal predecessors, (309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions. [2022-04-28 08:14:11,371 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 35 [2022-04-28 08:14:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:11,371 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 313 transitions. [2022-04-28 08:14:11,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 313 transitions. [2022-04-28 08:14:11,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:11,677 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-28 08:14:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 08:14:11,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:11,678 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-28 08:14:11,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:14:11,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 1 times [2022-04-28 08:14:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1413947360] [2022-04-28 08:14:11,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 2 times [2022-04-28 08:14:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:11,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902382161] [2022-04-28 08:14:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:11,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3183#true} is VALID [2022-04-28 08:14:11,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-28 08:14:11,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-28 08:14:11,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {3183#true} call ULTIMATE.init(); {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:11,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {3191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3183#true} is VALID [2022-04-28 08:14:11,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-28 08:14:11,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-28 08:14:11,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret59 := main(); {3183#true} is VALID [2022-04-28 08:14:11,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {3183#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {3188#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:11,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {3188#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {3189#(not (= 8482 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:11,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {3189#(not (= 8482 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(0 != 12288 + ~tmp___1~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(0 == ~s__cert~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !false; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} ~state~0 := ~s__state~0; {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(12292 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(16384 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8192 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(24576 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8195 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8480 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume !(8481 == ~s__state~0); {3190#(not (= ssl3_accept_~s__state~0 8482))} is VALID [2022-04-28 08:14:11,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {3190#(not (= ssl3_accept_~s__state~0 8482))} assume 8482 == ~s__state~0; {3184#false} is VALID [2022-04-28 08:14:11,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#false} ~s__state~0 := 3; {3184#false} is VALID [2022-04-28 08:14:11,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {3184#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {3184#false} is VALID [2022-04-28 08:14:11,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#false} assume 0 == ~s__s3__tmp__reuse_message~0; {3184#false} is VALID [2022-04-28 08:14:11,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {3184#false} assume 0 == ~skip~0; {3184#false} is VALID [2022-04-28 08:14:11,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {3184#false} assume 8560 == ~state~0; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {3184#false} assume 8448 == ~s__state~0; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#false} assume -1 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#false} assume -2 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {3184#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {3184#false} is VALID [2022-04-28 08:14:11,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {3184#false} assume 4 != ~blastFlag~0; {3184#false} is VALID [2022-04-28 08:14:11,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {3184#false} assume 1024 != ~tmp___7~0; {3184#false} is VALID [2022-04-28 08:14:11,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2022-04-28 08:14:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902382161] [2022-04-28 08:14:11,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902382161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:11,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:11,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:11,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1413947360] [2022-04-28 08:14:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1413947360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:11,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:11,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889494008] [2022-04-28 08:14:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:11,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:11,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:11,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:11,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:11,812 INFO L87 Difference]: Start difference. First operand 200 states and 313 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:12,776 INFO L93 Difference]: Finished difference Result 393 states and 622 transitions. [2022-04-28 08:14:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:12,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:12,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-28 08:14:13,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:13,216 INFO L225 Difference]: With dead ends: 393 [2022-04-28 08:14:13,216 INFO L226 Difference]: Without dead ends: 207 [2022-04-28 08:14:13,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:13,218 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 758 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:13,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-28 08:14:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-28 08:14:13,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:13,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,241 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,241 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:13,249 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-28 08:14:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-28 08:14:13,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:13,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:13,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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) Second operand 207 states. [2022-04-28 08:14:13,250 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 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) Second operand 207 states. [2022-04-28 08:14:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:13,258 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-28 08:14:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-28 08:14:13,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:13,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:13,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:13,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5940594059405941) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2022-04-28 08:14:13,267 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 35 [2022-04-28 08:14:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:13,268 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2022-04-28 08:14:13,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 326 transitions. [2022-04-28 08:14:13,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-28 08:14:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 08:14:13,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:13,559 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-04-28 08:14:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:14:13,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 1 times [2022-04-28 08:14:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:13,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [54678439] [2022-04-28 08:14:13,561 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 2 times [2022-04-28 08:14:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:13,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467490217] [2022-04-28 08:14:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:13,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4814#true} is VALID [2022-04-28 08:14:13,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-28 08:14:13,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-28 08:14:13,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {4814#true} call ULTIMATE.init(); {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:13,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4814#true} is VALID [2022-04-28 08:14:13,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-28 08:14:13,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-28 08:14:13,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {4814#true} call #t~ret59 := main(); {4814#true} is VALID [2022-04-28 08:14:13,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {4814#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4819#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:13,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {4819#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {4820#(not (= |ssl3_accept_#in~initial_state| 8481))} is VALID [2022-04-28 08:14:13,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {4820#(not (= |ssl3_accept_#in~initial_state| 8481))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(0 != 12288 + ~tmp___1~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(0 == ~s__cert~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !false; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} ~state~0 := ~s__state~0; {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(12292 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(16384 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8192 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(24576 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8195 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume !(8480 == ~s__state~0); {4821#(not (= ssl3_accept_~s__state~0 8481))} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {4821#(not (= ssl3_accept_~s__state~0 8481))} assume 8481 == ~s__state~0; {4815#false} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {4815#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {4815#false} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {4815#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {4815#false} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {4815#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {4815#false} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#false} assume 0 == ~s__s3__tmp__reuse_message~0; {4815#false} is VALID [2022-04-28 08:14:13,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#false} assume 0 == ~skip~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {4815#false} assume 8560 == ~state~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {4815#false} assume 8448 == ~s__state~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {4815#false} assume -1 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {4815#false} assume -2 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {4815#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {4815#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {4815#false} assume 4 != ~blastFlag~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 33: Hoare triple {4815#false} assume 1024 != ~tmp___7~0; {4815#false} is VALID [2022-04-28 08:14:13,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {4815#false} assume !false; {4815#false} is VALID [2022-04-28 08:14:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:13,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:13,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467490217] [2022-04-28 08:14:13,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467490217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:13,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:13,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:13,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:13,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [54678439] [2022-04-28 08:14:13,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [54678439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:13,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:13,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687738223] [2022-04-28 08:14:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:13,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:13,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:13,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:13,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:13,748 INFO L87 Difference]: Start difference. First operand 207 states and 326 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:14,630 INFO L93 Difference]: Finished difference Result 402 states and 636 transitions. [2022-04-28 08:14:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 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) Word has length 35 [2022-04-28 08:14:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:14,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-28 08:14:14,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:15,002 INFO L225 Difference]: With dead ends: 402 [2022-04-28 08:14:15,002 INFO L226 Difference]: Without dead ends: 209 [2022-04-28 08:14:15,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:15,004 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 759 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:15,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-28 08:14:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-28 08:14:15,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:15,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,032 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,032 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:15,038 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-28 08:14:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-28 08:14:15,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:15,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:15,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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) Second operand 209 states. [2022-04-28 08:14:15,040 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 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) Second operand 209 states. [2022-04-28 08:14:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:15,045 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-28 08:14:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-28 08:14:15,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:15,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:15,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:15,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5891089108910892) internal successors, (321), 202 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 325 transitions. [2022-04-28 08:14:15,051 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 325 transitions. Word has length 35 [2022-04-28 08:14:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 325 transitions. [2022-04-28 08:14:15,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 325 transitions. [2022-04-28 08:14:15,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 325 transitions. [2022-04-28 08:14:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 08:14:15,398 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:15,398 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:15,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:14:15,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 1 times [2022-04-28 08:14:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:15,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661204867] [2022-04-28 08:14:15,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 2 times [2022-04-28 08:14:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:15,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341480137] [2022-04-28 08:14:15,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:15,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {6475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6467#true} is VALID [2022-04-28 08:14:15,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-28 08:14:15,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-28 08:14:15,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {6467#true} call ULTIMATE.init(); {6475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:15,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {6475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6467#true} is VALID [2022-04-28 08:14:15,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-28 08:14:15,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-28 08:14:15,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {6467#true} call #t~ret59 := main(); {6467#true} is VALID [2022-04-28 08:14:15,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {6467#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {6472#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:15,515 INFO L272 TraceCheckUtils]: 6: Hoare triple {6472#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {6473#(not (= 16384 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:15,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {6473#(not (= 16384 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(0 != 12288 + ~tmp___1~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(0 == ~s__cert~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !false; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} ~state~0 := ~s__state~0; {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume !(12292 == ~s__state~0); {6474#(not (= ssl3_accept_~s__state~0 16384))} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {6474#(not (= ssl3_accept_~s__state~0 16384))} assume 16384 == ~s__state~0; {6468#false} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {6468#false} ~s__server~0 := 1; {6468#false} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {6468#false} assume 0 != ~cb~0; {6468#false} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {6468#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {6468#false} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {6468#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {6468#false} is VALID [2022-04-28 08:14:15,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {6468#false} assume !(0 == ~s__init_buf___0~0); {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {6468#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {6468#false} assume 12292 != ~s__state~0; {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {6468#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {6468#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {6468#false} assume 0 == ~s__s3__tmp__reuse_message~0; {6468#false} is VALID [2022-04-28 08:14:15,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {6468#false} assume 0 == ~skip~0; {6468#false} is VALID [2022-04-28 08:14:15,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {6468#false} assume 8560 == ~state~0; {6468#false} is VALID [2022-04-28 08:14:15,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {6468#false} assume 8448 == ~s__state~0; {6468#false} is VALID [2022-04-28 08:14:15,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {6468#false} assume -1 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-28 08:14:15,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {6468#false} assume -2 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-28 08:14:15,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {6468#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {6468#false} is VALID [2022-04-28 08:14:15,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {6468#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {6468#false} is VALID [2022-04-28 08:14:15,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {6468#false} assume 4 != ~blastFlag~0; {6468#false} is VALID [2022-04-28 08:14:15,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {6468#false} assume 1024 != ~tmp___7~0; {6468#false} is VALID [2022-04-28 08:14:15,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {6468#false} assume !false; {6468#false} is VALID [2022-04-28 08:14:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:15,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341480137] [2022-04-28 08:14:15,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341480137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:15,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:15,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:15,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:15,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661204867] [2022-04-28 08:14:15,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661204867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:15,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:15,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620311836] [2022-04-28 08:14:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 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) Word has length 36 [2022-04-28 08:14:15,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:15,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:15,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:15,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:15,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:15,556 INFO L87 Difference]: Start difference. First operand 207 states and 325 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:16,412 INFO L93 Difference]: Finished difference Result 410 states and 644 transitions. [2022-04-28 08:14:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 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) Word has length 36 [2022-04-28 08:14:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-28 08:14:16,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-28 08:14:16,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:16,790 INFO L225 Difference]: With dead ends: 410 [2022-04-28 08:14:16,790 INFO L226 Difference]: Without dead ends: 217 [2022-04-28 08:14:16,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:16,791 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:16,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 197 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-28 08:14:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-28 08:14:16,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:16,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,818 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,818 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:16,824 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-28 08:14:16,824 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-28 08:14:16,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:16,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:16,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 217 states. [2022-04-28 08:14:16,827 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 217 states. [2022-04-28 08:14:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:16,833 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-28 08:14:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-28 08:14:16,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:16,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:16,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:16,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5792079207920793) internal successors, (319), 202 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 323 transitions. [2022-04-28 08:14:16,840 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 323 transitions. Word has length 36 [2022-04-28 08:14:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:16,840 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 323 transitions. [2022-04-28 08:14:16,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:16,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 323 transitions. [2022-04-28 08:14:17,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 323 transitions. [2022-04-28 08:14:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 08:14:17,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:17,149 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:14:17,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 1 times [2022-04-28 08:14:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893066812] [2022-04-28 08:14:17,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 2 times [2022-04-28 08:14:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031177306] [2022-04-28 08:14:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:17,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8152#true} is VALID [2022-04-28 08:14:17,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-28 08:14:17,231 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-28 08:14:17,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {8152#true} call ULTIMATE.init(); {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:17,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {8160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8152#true} is VALID [2022-04-28 08:14:17,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-28 08:14:17,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-28 08:14:17,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {8152#true} call #t~ret59 := main(); {8152#true} is VALID [2022-04-28 08:14:17,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {8152#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {8157#(<= 8464 main_~s~0)} is VALID [2022-04-28 08:14:17,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {8157#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {8158#(not (= 8192 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:17,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {8158#(not (= 8192 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !false; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {8159#(not (= 8192 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:17,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {8159#(not (= 8192 ssl3_accept_~s__state~0))} assume 8192 == ~s__state~0; {8153#false} is VALID [2022-04-28 08:14:17,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {8153#false} ~s__server~0 := 1; {8153#false} is VALID [2022-04-28 08:14:17,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {8153#false} assume 0 != ~cb~0; {8153#false} is VALID [2022-04-28 08:14:17,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {8153#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {8153#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {8153#false} assume !(0 == ~s__init_buf___0~0); {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {8153#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {8153#false} assume 12292 != ~s__state~0; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {8153#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {8153#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {8153#false} assume 0 == ~s__s3__tmp__reuse_message~0; {8153#false} is VALID [2022-04-28 08:14:17,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {8153#false} assume 0 == ~skip~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {8153#false} assume 8560 == ~state~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {8153#false} assume 8448 == ~s__state~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {8153#false} assume -1 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {8153#false} assume -2 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {8153#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {8153#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {8153#false} assume 4 != ~blastFlag~0; {8153#false} is VALID [2022-04-28 08:14:17,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {8153#false} assume 1024 != ~tmp___7~0; {8153#false} is VALID [2022-04-28 08:14:17,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {8153#false} assume !false; {8153#false} is VALID [2022-04-28 08:14:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:17,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031177306] [2022-04-28 08:14:17,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031177306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:17,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:17,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:17,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:17,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893066812] [2022-04-28 08:14:17,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893066812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:17,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:17,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125685947] [2022-04-28 08:14:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:17,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 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) Word has length 37 [2022-04-28 08:14:17,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:17,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:17,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:17,266 INFO L87 Difference]: Start difference. First operand 207 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:18,031 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2022-04-28 08:14:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:18,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 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) Word has length 37 [2022-04-28 08:14:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-28 08:14:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-28 08:14:18,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 523 transitions. [2022-04-28 08:14:18,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:18,441 INFO L225 Difference]: With dead ends: 410 [2022-04-28 08:14:18,441 INFO L226 Difference]: Without dead ends: 217 [2022-04-28 08:14:18,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:18,443 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:18,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 198 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-28 08:14:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-28 08:14:18,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:18,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,475 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,476 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:18,483 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-28 08:14:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-28 08:14:18,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:18,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:18,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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) Second operand 217 states. [2022-04-28 08:14:18,485 INFO L87 Difference]: Start difference. First operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 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) Second operand 217 states. [2022-04-28 08:14:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:18,490 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-28 08:14:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-28 08:14:18,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:18,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:18,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:18,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.5693069306930694) internal successors, (317), 202 states have internal predecessors, (317), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2022-04-28 08:14:18,496 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 37 [2022-04-28 08:14:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:18,497 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2022-04-28 08:14:18,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 321 transitions. [2022-04-28 08:14:18,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2022-04-28 08:14:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 08:14:18,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:18,851 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:18,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:14:18,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 1 times [2022-04-28 08:14:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:18,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1990750963] [2022-04-28 08:14:18,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 2 times [2022-04-28 08:14:18,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:18,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681921720] [2022-04-28 08:14:18,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:18,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9837#true} is VALID [2022-04-28 08:14:18,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-28 08:14:18,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-28 08:14:18,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {9837#true} call ULTIMATE.init(); {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:18,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {9837#true} call #t~ret59 := main(); {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {9837#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {9837#true} call #t~ret58 := ssl3_accept(~s~0); {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {9837#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {9837#true} is VALID [2022-04-28 08:14:18,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {9837#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {9837#true} is VALID [2022-04-28 08:14:18,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {9837#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {9837#true} is VALID [2022-04-28 08:14:18,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {9837#true} assume !(0 != 12288 + ~tmp___1~0); {9837#true} is VALID [2022-04-28 08:14:18,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {9837#true} assume !(0 == ~s__cert~0); {9837#true} is VALID [2022-04-28 08:14:18,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {9837#true} assume !false; {9837#true} is VALID [2022-04-28 08:14:18,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {9837#true} ~state~0 := ~s__state~0; {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(12292 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(16384 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8192 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(24576 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8195 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8480 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8481 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume !(8482 == ~s__state~0); {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} is VALID [2022-04-28 08:14:18,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {9842#(or (not (= 8464 ssl3_accept_~s__state~0)) (not (= 8560 ssl3_accept_~state~0)))} assume 8464 == ~s__state~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~s__s3__tmp__reuse_message~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 0 == ~skip~0; {9843#(not (= 8560 ssl3_accept_~state~0))} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 8560 == ~state~0; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {9838#false} assume 8448 == ~s__state~0; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {9838#false} assume -1 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {9838#false} assume -2 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {9838#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {9838#false} is VALID [2022-04-28 08:14:18,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {9838#false} assume 4 != ~blastFlag~0; {9838#false} is VALID [2022-04-28 08:14:18,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {9838#false} assume 1024 != ~tmp___7~0; {9838#false} is VALID [2022-04-28 08:14:18,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {9838#false} assume !false; {9838#false} is VALID [2022-04-28 08:14:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:18,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:18,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681921720] [2022-04-28 08:14:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681921720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:18,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:18,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:18,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:18,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1990750963] [2022-04-28 08:14:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1990750963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:18,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:18,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:14:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384913350] [2022-04-28 08:14:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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 38 [2022-04-28 08:14:18,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:18,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:18,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:18,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:14:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:14:18,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:14:18,964 INFO L87 Difference]: Start difference. First operand 207 states and 321 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:19,723 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2022-04-28 08:14:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:14:19,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 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 38 [2022-04-28 08:14:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-28 08:14:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-28 08:14:19,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-28 08:14:20,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:20,177 INFO L225 Difference]: With dead ends: 443 [2022-04-28 08:14:20,177 INFO L226 Difference]: Without dead ends: 250 [2022-04-28 08:14:20,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:14:20,178 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 482 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:20,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 195 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-28 08:14:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 214. [2022-04-28 08:14:20,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:20,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,203 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,203 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:20,209 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-28 08:14:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-28 08:14:20,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:20,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:20,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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) Second operand 250 states. [2022-04-28 08:14:20,211 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 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) Second operand 250 states. [2022-04-28 08:14:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:20,216 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-28 08:14:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-28 08:14:20,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:20,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:20,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:20,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:20,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2022-04-28 08:14:20,223 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 38 [2022-04-28 08:14:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:20,223 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2022-04-28 08:14:20,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 331 transitions. [2022-04-28 08:14:20,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2022-04-28 08:14:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 08:14:20,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:20,597 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:20,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:14:20,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 1 times [2022-04-28 08:14:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:20,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372743141] [2022-04-28 08:14:20,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:20,599 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 2 times [2022-04-28 08:14:20,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:20,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785315886] [2022-04-28 08:14:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:20,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {11675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11667#true} is VALID [2022-04-28 08:14:20,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-28 08:14:20,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-28 08:14:20,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {11667#true} call ULTIMATE.init(); {11675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:20,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {11675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11667#true} is VALID [2022-04-28 08:14:20,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-28 08:14:20,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-28 08:14:20,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret59 := main(); {11667#true} is VALID [2022-04-28 08:14:20,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {11672#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:20,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {11672#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {11673#(not (= 24576 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:20,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {11673#(not (= 24576 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !false; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {11674#(not (= 24576 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {11674#(not (= 24576 ssl3_accept_~s__state~0))} assume 24576 == ~s__state~0; {11668#false} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {11668#false} ~s__server~0 := 1; {11668#false} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {11668#false} assume 0 != ~cb~0; {11668#false} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {11668#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {11668#false} is VALID [2022-04-28 08:14:20,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {11668#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {11668#false} assume !(0 == ~s__init_buf___0~0); {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {11668#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {11668#false} assume 12292 != ~s__state~0; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {11668#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {11668#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {11668#false} assume 0 == ~s__s3__tmp__reuse_message~0; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {11668#false} assume 0 == ~skip~0; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {11668#false} assume 8560 == ~state~0; {11668#false} is VALID [2022-04-28 08:14:20,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} assume 8448 == ~s__state~0; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume -1 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume -2 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {11668#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {11668#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {11668#false} assume 4 != ~blastFlag~0; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {11668#false} assume 1024 != ~tmp___7~0; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-28 08:14:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785315886] [2022-04-28 08:14:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785315886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:20,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:20,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:20,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372743141] [2022-04-28 08:14:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372743141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:20,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:20,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730792021] [2022-04-28 08:14:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 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) Word has length 38 [2022-04-28 08:14:20,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:20,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:20,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:20,699 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:21,573 INFO L93 Difference]: Finished difference Result 424 states and 656 transitions. [2022-04-28 08:14:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 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) Word has length 38 [2022-04-28 08:14:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-28 08:14:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-28 08:14:21,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-28 08:14:22,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:22,012 INFO L225 Difference]: With dead ends: 424 [2022-04-28 08:14:22,012 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 08:14:22,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:22,013 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:22,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 199 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 08:14:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-28 08:14:22,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:22,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,041 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,042 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:22,046 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-28 08:14:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-28 08:14:22,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:22,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:22,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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) Second operand 224 states. [2022-04-28 08:14:22,049 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 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) Second operand 224 states. [2022-04-28 08:14:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:22,054 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-28 08:14:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-28 08:14:22,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:22,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:22,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:22,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.555023923444976) internal successors, (325), 209 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2022-04-28 08:14:22,060 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 38 [2022-04-28 08:14:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:22,060 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2022-04-28 08:14:22,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 329 transitions. [2022-04-28 08:14:22,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2022-04-28 08:14:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:14:22,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:22,529 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:22,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:14:22,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:22,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 1 times [2022-04-28 08:14:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:22,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [969276016] [2022-04-28 08:14:22,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 2 times [2022-04-28 08:14:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451944813] [2022-04-28 08:14:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:22,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:22,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {13416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13408#true} is VALID [2022-04-28 08:14:22,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-28 08:14:22,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-28 08:14:22,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {13408#true} call ULTIMATE.init(); {13416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:22,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {13416#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13408#true} is VALID [2022-04-28 08:14:22,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-28 08:14:22,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-28 08:14:22,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {13408#true} call #t~ret59 := main(); {13408#true} is VALID [2022-04-28 08:14:22,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {13408#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {13413#(<= 8464 main_~s~0)} is VALID [2022-04-28 08:14:22,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {13413#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {13414#(not (= 8195 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:22,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {13414#(not (= 8195 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(0 != 12288 + ~tmp___1~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(0 == ~s__cert~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !false; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} ~state~0 := ~s__state~0; {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(12292 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(16384 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(8192 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume !(24576 == ~s__state~0); {13415#(not (= ssl3_accept_~s__state~0 8195))} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {13415#(not (= ssl3_accept_~s__state~0 8195))} assume 8195 == ~s__state~0; {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {13409#false} ~s__server~0 := 1; {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {13409#false} assume 0 != ~cb~0; {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {13409#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {13409#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {13409#false} assume !(0 == ~s__init_buf___0~0); {13409#false} is VALID [2022-04-28 08:14:22,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {13409#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {13409#false} assume 12292 != ~s__state~0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {13409#false} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post33 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post33;havoc #t~post33; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {13409#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {13409#false} assume 0 == ~s__s3__tmp__reuse_message~0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {13409#false} assume 0 == ~skip~0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {13409#false} assume 8560 == ~state~0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {13409#false} assume 8448 == ~s__state~0; {13409#false} is VALID [2022-04-28 08:14:22,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {13409#false} assume -1 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {13409#false} assume -2 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {13409#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {13409#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {13409#false} assume 4 != ~blastFlag~0; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {13409#false} assume 1024 != ~tmp___7~0; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {13409#false} assume !false; {13409#false} is VALID [2022-04-28 08:14:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451944813] [2022-04-28 08:14:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451944813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:22,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:22,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:22,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [969276016] [2022-04-28 08:14:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [969276016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:22,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:22,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:22,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3479521] [2022-04-28 08:14:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 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) Word has length 39 [2022-04-28 08:14:22,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:22,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:22,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:22,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:22,636 INFO L87 Difference]: Start difference. First operand 214 states and 329 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:23,516 INFO L93 Difference]: Finished difference Result 424 states and 652 transitions. [2022-04-28 08:14:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 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) Word has length 39 [2022-04-28 08:14:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-28 08:14:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-28 08:14:23,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-28 08:14:23,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:23,907 INFO L225 Difference]: With dead ends: 424 [2022-04-28 08:14:23,907 INFO L226 Difference]: Without dead ends: 224 [2022-04-28 08:14:23,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:23,908 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 767 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:23,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 200 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-28 08:14:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-28 08:14:23,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:23,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,936 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,936 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:23,941 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-28 08:14:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-28 08:14:23,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:23,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:23,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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) Second operand 224 states. [2022-04-28 08:14:23,942 INFO L87 Difference]: Start difference. First operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 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) Second operand 224 states. [2022-04-28 08:14:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:23,946 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-28 08:14:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-28 08:14:23,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:23,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:23,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:23,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.5454545454545454) internal successors, (323), 209 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2022-04-28 08:14:23,952 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 39 [2022-04-28 08:14:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:23,952 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2022-04-28 08:14:23,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:23,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 327 transitions. [2022-04-28 08:14:24,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2022-04-28 08:14:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 08:14:24,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:24,348 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:24,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:14:24,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 1 times [2022-04-28 08:14:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:24,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [870750088] [2022-04-28 08:14:24,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 2 times [2022-04-28 08:14:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:24,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677516682] [2022-04-28 08:14:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:24,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:24,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 08:14:24,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 08:14:24,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-28 08:14:24,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {15149#true} call ULTIMATE.init(); {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:24,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {15157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15149#true} is VALID [2022-04-28 08:14:24,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-28 08:14:24,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-28 08:14:24,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret59 := main(); {15149#true} is VALID [2022-04-28 08:14:24,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {15149#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {15154#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:24,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {15154#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {15155#(not (= 8465 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:24,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {15155#(not (= 8465 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(0 != 12288 + ~tmp___1~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(0 == ~s__cert~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !false; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} ~state~0 := ~s__state~0; {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(12292 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(16384 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8192 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(24576 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8195 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8480 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8481 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8482 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume !(8464 == ~s__state~0); {15156#(not (= ssl3_accept_~s__state~0 8465))} is VALID [2022-04-28 08:14:24,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {15156#(not (= ssl3_accept_~s__state~0 8465))} assume 8465 == ~s__state~0; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {15150#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {15150#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {15150#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {15150#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume 0 == ~s__s3__tmp__reuse_message~0; {15150#false} is VALID [2022-04-28 08:14:24,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {15150#false} assume 0 == ~skip~0; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {15150#false} assume 8560 == ~state~0; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {15150#false} assume 8448 == ~s__state~0; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {15150#false} assume -1 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {15150#false} assume -2 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {15150#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {15150#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {15150#false} is VALID [2022-04-28 08:14:24,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {15150#false} assume 4 != ~blastFlag~0; {15150#false} is VALID [2022-04-28 08:14:24,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {15150#false} assume 1024 != ~tmp___7~0; {15150#false} is VALID [2022-04-28 08:14:24,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-28 08:14:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:24,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:24,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677516682] [2022-04-28 08:14:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677516682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:24,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:24,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:24,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:24,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [870750088] [2022-04-28 08:14:24,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [870750088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:24,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:24,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617841723] [2022-04-28 08:14:24,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:24,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 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) Word has length 39 [2022-04-28 08:14:24,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:24,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:24,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:24,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:24,483 INFO L87 Difference]: Start difference. First operand 214 states and 327 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:25,307 INFO L93 Difference]: Finished difference Result 419 states and 644 transitions. [2022-04-28 08:14:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 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) Word has length 39 [2022-04-28 08:14:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-28 08:14:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-28 08:14:25,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-28 08:14:25,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:25,728 INFO L225 Difference]: With dead ends: 419 [2022-04-28 08:14:25,728 INFO L226 Difference]: Without dead ends: 219 [2022-04-28 08:14:25,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:25,730 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 754 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:25,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 204 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-28 08:14:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-04-28 08:14:25,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:25,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,758 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,758 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:25,762 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-28 08:14:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-28 08:14:25,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:25,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:25,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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) Second operand 219 states. [2022-04-28 08:14:25,764 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 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) Second operand 219 states. [2022-04-28 08:14:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:25,768 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-28 08:14:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-28 08:14:25,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:25,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:25,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:25,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.5450236966824644) internal successors, (326), 211 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 330 transitions. [2022-04-28 08:14:25,774 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 330 transitions. Word has length 39 [2022-04-28 08:14:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:25,774 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 330 transitions. [2022-04-28 08:14:25,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:25,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 330 transitions. [2022-04-28 08:14:26,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 330 transitions. [2022-04-28 08:14:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 08:14:26,195 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:26,195 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:26,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:14:26,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 1 times [2022-04-28 08:14:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:26,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320789591] [2022-04-28 08:14:26,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:26,196 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 2 times [2022-04-28 08:14:26,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:26,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967430044] [2022-04-28 08:14:26,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:26,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {16882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16874#true} is VALID [2022-04-28 08:14:26,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-28 08:14:26,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-28 08:14:26,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {16874#true} call ULTIMATE.init(); {16882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:26,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {16882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16874#true} is VALID [2022-04-28 08:14:26,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-28 08:14:26,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-28 08:14:26,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {16874#true} call #t~ret59 := main(); {16874#true} is VALID [2022-04-28 08:14:26,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {16874#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {16879#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:26,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {16879#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {16880#(not (= 8466 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:26,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {16880#(not (= 8466 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !false; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {16881#(not (= 8466 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {16881#(not (= 8466 ssl3_accept_~s__state~0))} assume 8466 == ~s__state~0; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {16875#false} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~ret~0 := #t~nondet36;havoc #t~nondet36; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {16875#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {16875#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {16875#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {16875#false} assume 0 == ~s__s3__tmp__reuse_message~0; {16875#false} is VALID [2022-04-28 08:14:26,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {16875#false} assume 0 == ~skip~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {16875#false} assume 8560 == ~state~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {16875#false} assume 8448 == ~s__state~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {16875#false} assume -1 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {16875#false} assume -2 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {16875#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {16875#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {16875#false} assume 4 != ~blastFlag~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {16875#false} assume 1024 != ~tmp___7~0; {16875#false} is VALID [2022-04-28 08:14:26,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {16875#false} assume !false; {16875#false} is VALID [2022-04-28 08:14:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:26,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967430044] [2022-04-28 08:14:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967430044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:26,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:26,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:26,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:26,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320789591] [2022-04-28 08:14:26,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320789591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:26,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:26,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:26,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061675667] [2022-04-28 08:14:26,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 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) Word has length 40 [2022-04-28 08:14:26,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:26,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:26,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:26,296 INFO L87 Difference]: Start difference. First operand 216 states and 330 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:27,070 INFO L93 Difference]: Finished difference Result 444 states and 678 transitions. [2022-04-28 08:14:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:27,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 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) Word has length 40 [2022-04-28 08:14:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-28 08:14:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-28 08:14:27,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-28 08:14:27,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:27,467 INFO L225 Difference]: With dead ends: 444 [2022-04-28 08:14:27,467 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 08:14:27,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:27,468 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 754 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:27,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 205 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 08:14:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2022-04-28 08:14:27,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:27,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,507 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,507 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:27,512 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-28 08:14:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-28 08:14:27,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:27,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:27,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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) Second operand 242 states. [2022-04-28 08:14:27,514 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 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) Second operand 242 states. [2022-04-28 08:14:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:27,518 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-28 08:14:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-28 08:14:27,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:27,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:27,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:27,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.5256410256410255) internal successors, (357), 234 states have internal predecessors, (357), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 361 transitions. [2022-04-28 08:14:27,526 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 361 transitions. Word has length 40 [2022-04-28 08:14:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:27,526 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 361 transitions. [2022-04-28 08:14:27,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:27,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 361 transitions. [2022-04-28 08:14:27,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 361 transitions. [2022-04-28 08:14:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 08:14:28,000 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:28,000 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:14:28,000 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 1 times [2022-04-28 08:14:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1074194436] [2022-04-28 08:14:28,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:28,002 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 2 times [2022-04-28 08:14:28,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:28,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740500215] [2022-04-28 08:14:28,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:28,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:28,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:28,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {18749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18741#true} is VALID [2022-04-28 08:14:28,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-28 08:14:28,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-28 08:14:28,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {18741#true} call ULTIMATE.init(); {18749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:28,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {18749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18741#true} is VALID [2022-04-28 08:14:28,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-28 08:14:28,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-28 08:14:28,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {18741#true} call #t~ret59 := main(); {18741#true} is VALID [2022-04-28 08:14:28,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {18741#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {18746#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:28,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {18746#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {18747#(not (= 8496 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:28,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {18747#(not (= 8496 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !false; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,074 INFO L290 TraceCheckUtils]: 23: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {18748#(not (= 8496 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {18748#(not (= 8496 ssl3_accept_~s__state~0))} assume 8496 == ~s__state~0; {18742#false} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {18742#false} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {18742#false} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {18742#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {18742#false} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {18742#false} assume !(~ret~0 <= 0); {18742#false} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {18742#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {18742#false} is VALID [2022-04-28 08:14:28,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {18742#false} ~s__init_num~0 := 0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {18742#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {18742#false} assume 0 == ~s__s3__tmp__reuse_message~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {18742#false} assume 0 == ~skip~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {18742#false} assume 8560 == ~state~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {18742#false} assume 8448 == ~s__state~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {18742#false} assume -1 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {18742#false} assume -2 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {18742#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {18742#false} is VALID [2022-04-28 08:14:28,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {18742#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {18742#false} is VALID [2022-04-28 08:14:28,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {18742#false} assume 4 != ~blastFlag~0; {18742#false} is VALID [2022-04-28 08:14:28,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {18742#false} assume 1024 != ~tmp___7~0; {18742#false} is VALID [2022-04-28 08:14:28,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {18742#false} assume !false; {18742#false} is VALID [2022-04-28 08:14:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740500215] [2022-04-28 08:14:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740500215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:28,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:28,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:28,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:28,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1074194436] [2022-04-28 08:14:28,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1074194436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:28,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:28,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:28,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986517526] [2022-04-28 08:14:28,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:28,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 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) Word has length 43 [2022-04-28 08:14:28,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:28,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:28,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:28,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:28,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:28,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:28,111 INFO L87 Difference]: Start difference. First operand 239 states and 361 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:28,902 INFO L93 Difference]: Finished difference Result 493 states and 745 transitions. [2022-04-28 08:14:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 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) Word has length 43 [2022-04-28 08:14:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-28 08:14:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-28 08:14:28,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 529 transitions. [2022-04-28 08:14:29,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:29,260 INFO L225 Difference]: With dead ends: 493 [2022-04-28 08:14:29,260 INFO L226 Difference]: Without dead ends: 268 [2022-04-28 08:14:29,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:29,262 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 732 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:29,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 220 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-28 08:14:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-04-28 08:14:29,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:29,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:29,299 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:29,300 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:29,305 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-28 08:14:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-28 08:14:29,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:29,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:29,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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) Second operand 268 states. [2022-04-28 08:14:29,306 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 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) Second operand 268 states. [2022-04-28 08:14:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:29,311 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-28 08:14:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-28 08:14:29,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:29,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:29,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:29,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.5096525096525097) internal successors, (391), 259 states have internal predecessors, (391), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 395 transitions. [2022-04-28 08:14:29,319 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 395 transitions. Word has length 43 [2022-04-28 08:14:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:29,319 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 395 transitions. [2022-04-28 08:14:29,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:29,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 395 transitions. [2022-04-28 08:14:29,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2022-04-28 08:14:29,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 08:14:29,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:29,918 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:29,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:14:29,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 1 times [2022-04-28 08:14:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:29,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786489929] [2022-04-28 08:14:29,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 2 times [2022-04-28 08:14:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:29,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535872231] [2022-04-28 08:14:29,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:30,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {20816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20808#true} is VALID [2022-04-28 08:14:30,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-28 08:14:30,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-28 08:14:30,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {20808#true} call ULTIMATE.init(); {20816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:30,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {20816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20808#true} is VALID [2022-04-28 08:14:30,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-28 08:14:30,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-28 08:14:30,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {20808#true} call #t~ret59 := main(); {20808#true} is VALID [2022-04-28 08:14:30,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {20808#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {20813#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:30,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {20813#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {20814#(not (= |ssl3_accept_#in~initial_state| 8512))} is VALID [2022-04-28 08:14:30,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {20814#(not (= |ssl3_accept_#in~initial_state| 8512))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(0 != 12288 + ~tmp___1~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(0 == ~s__cert~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !false; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} ~state~0 := ~s__state~0; {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(12292 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(16384 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8192 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(24576 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8195 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8480 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8481 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8482 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8464 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8465 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8466 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8496 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume !(8497 == ~s__state~0); {20815#(not (= ssl3_accept_~s__state~0 8512))} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {20815#(not (= ssl3_accept_~s__state~0 8512))} assume 8512 == ~s__state~0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {20809#false} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {20809#false} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~__cil_tmp56~0 := 256345;~skip~0 := 1; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {20809#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {20809#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {20809#false} assume 0 == ~s__s3__tmp__reuse_message~0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {20809#false} assume 0 == ~skip~0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {20809#false} assume 8560 == ~state~0; {20809#false} is VALID [2022-04-28 08:14:30,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {20809#false} assume 8448 == ~s__state~0; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {20809#false} assume -1 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {20809#false} assume -2 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {20809#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {20809#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {20809#false} assume 4 != ~blastFlag~0; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {20809#false} assume 1024 != ~tmp___7~0; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {20809#false} assume !false; {20809#false} is VALID [2022-04-28 08:14:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535872231] [2022-04-28 08:14:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535872231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:30,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:30,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786489929] [2022-04-28 08:14:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786489929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:30,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:30,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434166689] [2022-04-28 08:14:30,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:30,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 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) Word has length 43 [2022-04-28 08:14:30,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:30,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:30,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:30,073 INFO L87 Difference]: Start difference. First operand 264 states and 395 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:30,934 INFO L93 Difference]: Finished difference Result 547 states and 818 transitions. [2022-04-28 08:14:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 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) Word has length 43 [2022-04-28 08:14:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-28 08:14:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-28 08:14:30,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-28 08:14:31,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:31,293 INFO L225 Difference]: With dead ends: 547 [2022-04-28 08:14:31,293 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 08:14:31,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:31,294 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 768 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:31,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 206 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 08:14:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2022-04-28 08:14:31,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:31,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:31,334 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:31,335 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:31,341 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-28 08:14:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-28 08:14:31,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:31,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:31,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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) Second operand 297 states. [2022-04-28 08:14:31,342 INFO L87 Difference]: Start difference. First operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 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) Second operand 297 states. [2022-04-28 08:14:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:31,348 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-28 08:14:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-28 08:14:31,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:31,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:31,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:31,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.494773519163763) internal successors, (429), 287 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 433 transitions. [2022-04-28 08:14:31,357 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 433 transitions. Word has length 43 [2022-04-28 08:14:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:31,357 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 433 transitions. [2022-04-28 08:14:31,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:31,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 433 transitions. [2022-04-28 08:14:31,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 433 transitions. [2022-04-28 08:14:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 08:14:31,974 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:31,974 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:31,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:14:31,974 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 1 times [2022-04-28 08:14:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:31,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961375717] [2022-04-28 08:14:31,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:31,975 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 2 times [2022-04-28 08:14:31,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:31,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097801777] [2022-04-28 08:14:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:32,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {23105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23097#true} is VALID [2022-04-28 08:14:32,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-28 08:14:32,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-28 08:14:32,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {23097#true} call ULTIMATE.init(); {23105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:32,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {23105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23097#true} is VALID [2022-04-28 08:14:32,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-28 08:14:32,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-28 08:14:32,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {23097#true} call #t~ret59 := main(); {23097#true} is VALID [2022-04-28 08:14:32,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {23097#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {23102#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:32,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {23102#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {23103#(not (= 8497 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:32,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {23103#(not (= 8497 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !false; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {23104#(not (= 8497 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {23104#(not (= 8497 ssl3_accept_~s__state~0))} assume 8497 == ~s__state~0; {23098#false} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {23098#false} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {23098#false} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {23098#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23098#false} is VALID [2022-04-28 08:14:32,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {23098#false} assume !(~ret~0 <= 0); {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {23098#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {23098#false} ~s__init_num~0 := 0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {23098#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {23098#false} assume 0 == ~s__s3__tmp__reuse_message~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {23098#false} assume 0 == ~skip~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {23098#false} assume 8560 == ~state~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {23098#false} assume 8448 == ~s__state~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {23098#false} assume -1 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {23098#false} assume -2 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-28 08:14:32,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {23098#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {23098#false} is VALID [2022-04-28 08:14:32,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {23098#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {23098#false} is VALID [2022-04-28 08:14:32,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {23098#false} assume 4 != ~blastFlag~0; {23098#false} is VALID [2022-04-28 08:14:32,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {23098#false} assume 1024 != ~tmp___7~0; {23098#false} is VALID [2022-04-28 08:14:32,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {23098#false} assume !false; {23098#false} is VALID [2022-04-28 08:14:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097801777] [2022-04-28 08:14:32,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097801777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:32,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:32,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:32,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:32,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961375717] [2022-04-28 08:14:32,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961375717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:32,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:32,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506000766] [2022-04-28 08:14:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:32,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 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) Word has length 44 [2022-04-28 08:14:32,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:32,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:32,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:32,071 INFO L87 Difference]: Start difference. First operand 292 states and 433 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:32,830 INFO L93 Difference]: Finished difference Result 575 states and 856 transitions. [2022-04-28 08:14:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 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) Word has length 44 [2022-04-28 08:14:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-28 08:14:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-28 08:14:32,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 531 transitions. [2022-04-28 08:14:33,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 531 edges. 531 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:33,246 INFO L225 Difference]: With dead ends: 575 [2022-04-28 08:14:33,246 INFO L226 Difference]: Without dead ends: 297 [2022-04-28 08:14:33,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:33,247 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 761 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:33,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 206 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:14:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-28 08:14:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-28 08:14:33,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:33,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:33,297 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:33,297 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:33,302 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-28 08:14:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-28 08:14:33,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:33,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:33,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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) Second operand 297 states. [2022-04-28 08:14:33,304 INFO L87 Difference]: Start difference. First operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 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) Second operand 297 states. [2022-04-28 08:14:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:33,309 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-28 08:14:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-28 08:14:33,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:33,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:33,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:33,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 288 states have (on average 1.4895833333333333) internal successors, (429), 288 states have internal predecessors, (429), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 433 transitions. [2022-04-28 08:14:33,317 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 433 transitions. Word has length 44 [2022-04-28 08:14:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:33,318 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 433 transitions. [2022-04-28 08:14:33,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:33,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 433 transitions. [2022-04-28 08:14:33,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 433 transitions. [2022-04-28 08:14:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 08:14:33,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:33,943 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:33,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:14:33,944 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:33,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 1 times [2022-04-28 08:14:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1976735134] [2022-04-28 08:14:33,945 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 2 times [2022-04-28 08:14:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307516671] [2022-04-28 08:14:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:34,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:34,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {25452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25444#true} is VALID [2022-04-28 08:14:34,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-28 08:14:34,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-28 08:14:34,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {25444#true} call ULTIMATE.init(); {25452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:34,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {25452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25444#true} is VALID [2022-04-28 08:14:34,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-28 08:14:34,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-28 08:14:34,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {25444#true} call #t~ret59 := main(); {25444#true} is VALID [2022-04-28 08:14:34,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {25444#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {25449#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:34,016 INFO L272 TraceCheckUtils]: 6: Hoare triple {25449#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {25450#(not (= 8513 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:34,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {25450#(not (= 8513 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !false; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {25451#(not (= 8513 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {25451#(not (= 8513 ssl3_accept_~s__state~0))} assume 8513 == ~s__state~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {25445#false} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {25445#false} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~__cil_tmp56~0 := 256345;~skip~0 := 1; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {25445#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {25445#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {25445#false} assume 0 == ~s__s3__tmp__reuse_message~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {25445#false} assume 0 == ~skip~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {25445#false} assume 8560 == ~state~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {25445#false} assume 8448 == ~s__state~0; {25445#false} is VALID [2022-04-28 08:14:34,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {25445#false} assume -1 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {25445#false} assume -2 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {25445#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {25445#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {25445#false} assume 4 != ~blastFlag~0; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {25445#false} assume 1024 != ~tmp___7~0; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {25445#false} assume !false; {25445#false} is VALID [2022-04-28 08:14:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307516671] [2022-04-28 08:14:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307516671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:34,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:34,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1976735134] [2022-04-28 08:14:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1976735134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:34,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422803950] [2022-04-28 08:14:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 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) Word has length 44 [2022-04-28 08:14:34,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:34,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:34,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:34,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:34,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:34,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:34,062 INFO L87 Difference]: Start difference. First operand 293 states and 433 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:34,833 INFO L93 Difference]: Finished difference Result 579 states and 859 transitions. [2022-04-28 08:14:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:34,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 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) Word has length 44 [2022-04-28 08:14:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-28 08:14:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-28 08:14:34,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-28 08:14:35,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:35,197 INFO L225 Difference]: With dead ends: 579 [2022-04-28 08:14:35,197 INFO L226 Difference]: Without dead ends: 300 [2022-04-28 08:14:35,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:35,198 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 763 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:35,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 208 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-28 08:14:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-28 08:14:35,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:35,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,251 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,251 INFO L87 Difference]: Start difference. First operand 300 states. Second operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:35,257 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-28 08:14:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-28 08:14:35,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:35,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:35,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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) Second operand 300 states. [2022-04-28 08:14:35,258 INFO L87 Difference]: Start difference. First operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 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) Second operand 300 states. [2022-04-28 08:14:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:35,264 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-28 08:14:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-28 08:14:35,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:35,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:35,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:35,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 290 states have internal predecessors, (432), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 436 transitions. [2022-04-28 08:14:35,273 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 436 transitions. Word has length 44 [2022-04-28 08:14:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:35,273 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 436 transitions. [2022-04-28 08:14:35,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 436 transitions. [2022-04-28 08:14:35,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 436 transitions. [2022-04-28 08:14:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 08:14:35,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:35,871 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:35,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:14:35,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 1 times [2022-04-28 08:14:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:35,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997451576] [2022-04-28 08:14:35,872 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 2 times [2022-04-28 08:14:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:35,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850518493] [2022-04-28 08:14:35,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:35,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:35,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27809#true} is VALID [2022-04-28 08:14:35,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-28 08:14:35,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-28 08:14:35,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {27809#true} call ULTIMATE.init(); {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:35,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {27817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27809#true} is VALID [2022-04-28 08:14:35,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-28 08:14:35,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-28 08:14:35,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {27809#true} call #t~ret59 := main(); {27809#true} is VALID [2022-04-28 08:14:35,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {27809#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {27814#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:35,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {27814#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {27815#(not (= 8544 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:35,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {27815#(not (= 8544 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(0 != 12288 + ~tmp___1~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(0 == ~s__cert~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !false; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} ~state~0 := ~s__state~0; {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(12292 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(16384 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8192 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(24576 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8195 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8480 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8481 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8482 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8464 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8465 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8466 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8496 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8497 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8512 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8513 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8528 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume !(8529 == ~s__state~0); {27816#(not (= ssl3_accept_~s__state~0 8544))} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {27816#(not (= ssl3_accept_~s__state~0 8544))} assume 8544 == ~s__state~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {27810#false} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {27810#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {27810#false} assume 0 == ~s__s3__tmp__reuse_message~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {27810#false} assume 0 == ~skip~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {27810#false} assume 8560 == ~state~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {27810#false} assume 8448 == ~s__state~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {27810#false} assume -1 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-28 08:14:35,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {27810#false} assume -2 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {27810#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {27810#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {27810#false} assume 4 != ~blastFlag~0; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {27810#false} assume 1024 != ~tmp___7~0; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {27810#false} assume !false; {27810#false} is VALID [2022-04-28 08:14:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:35,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:35,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850518493] [2022-04-28 08:14:35,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850518493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:35,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:35,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:35,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:35,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997451576] [2022-04-28 08:14:35,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997451576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:35,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:35,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079949850] [2022-04-28 08:14:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:35,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 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) Word has length 45 [2022-04-28 08:14:35,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:35,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:35,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:35,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:35,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:35,982 INFO L87 Difference]: Start difference. First operand 295 states and 436 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:36,789 INFO L93 Difference]: Finished difference Result 615 states and 910 transitions. [2022-04-28 08:14:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:36,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 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) Word has length 45 [2022-04-28 08:14:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-28 08:14:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-28 08:14:36,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 548 transitions. [2022-04-28 08:14:37,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:37,156 INFO L225 Difference]: With dead ends: 615 [2022-04-28 08:14:37,156 INFO L226 Difference]: Without dead ends: 334 [2022-04-28 08:14:37,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:37,157 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 785 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:37,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 209 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-04-28 08:14:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2022-04-28 08:14:37,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:37,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:37,224 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:37,224 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:37,231 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-28 08:14:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-28 08:14:37,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:37,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:37,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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) Second operand 334 states. [2022-04-28 08:14:37,232 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 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) Second operand 334 states. [2022-04-28 08:14:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:37,239 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-28 08:14:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-28 08:14:37,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:37,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:37,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:37,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.475) internal successors, (472), 320 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-28 08:14:37,248 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-28 08:14:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:37,248 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-28 08:14:37,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:37,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 476 transitions. [2022-04-28 08:14:37,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-28 08:14:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 08:14:37,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:37,937 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:37,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:14:37,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 1 times [2022-04-28 08:14:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:37,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325010812] [2022-04-28 08:14:37,938 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 2 times [2022-04-28 08:14:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:37,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140404503] [2022-04-28 08:14:37,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:38,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {30382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30374#true} is VALID [2022-04-28 08:14:38,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-28 08:14:38,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-28 08:14:38,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {30374#true} call ULTIMATE.init(); {30382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:38,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {30382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {30374#true} is VALID [2022-04-28 08:14:38,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-28 08:14:38,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-28 08:14:38,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {30374#true} call #t~ret59 := main(); {30374#true} is VALID [2022-04-28 08:14:38,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {30374#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {30379#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:38,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {30379#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {30380#(not (= 8545 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:38,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {30380#(not (= 8545 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(0 != 12288 + ~tmp___1~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(0 == ~s__cert~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !false; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} ~state~0 := ~s__state~0; {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(12292 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(16384 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8192 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(24576 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8195 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8480 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8481 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8482 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8464 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8465 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8466 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8496 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8497 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8512 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8513 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8528 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8529 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume !(8544 == ~s__state~0); {30381#(not (= ssl3_accept_~s__state~0 8545))} is VALID [2022-04-28 08:14:38,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {30381#(not (= ssl3_accept_~s__state~0 8545))} assume 8545 == ~s__state~0; {30375#false} is VALID [2022-04-28 08:14:38,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {30375#false} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {30375#false} is VALID [2022-04-28 08:14:38,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {30375#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {30375#false} assume 0 == ~s__s3__tmp__reuse_message~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {30375#false} assume 0 == ~skip~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {30375#false} assume 8560 == ~state~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {30375#false} assume 8448 == ~s__state~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {30375#false} assume -1 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {30375#false} assume -2 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {30375#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {30375#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {30375#false} assume 4 != ~blastFlag~0; {30375#false} is VALID [2022-04-28 08:14:38,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {30375#false} assume 1024 != ~tmp___7~0; {30375#false} is VALID [2022-04-28 08:14:38,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {30375#false} assume !false; {30375#false} is VALID [2022-04-28 08:14:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:38,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140404503] [2022-04-28 08:14:38,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140404503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:38,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:38,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:38,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:38,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325010812] [2022-04-28 08:14:38,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325010812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:38,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:38,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757748282] [2022-04-28 08:14:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 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) Word has length 46 [2022-04-28 08:14:38,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:38,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:38,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:38,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:38,056 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:38,875 INFO L93 Difference]: Finished difference Result 649 states and 957 transitions. [2022-04-28 08:14:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:38,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 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) Word has length 46 [2022-04-28 08:14:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-28 08:14:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-28 08:14:38,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 550 transitions. [2022-04-28 08:14:39,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:39,246 INFO L225 Difference]: With dead ends: 649 [2022-04-28 08:14:39,246 INFO L226 Difference]: Without dead ends: 338 [2022-04-28 08:14:39,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:39,247 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 788 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:39,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 209 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-28 08:14:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2022-04-28 08:14:39,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:39,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:39,305 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:39,306 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:39,312 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-28 08:14:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-28 08:14:39,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:39,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:39,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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) Second operand 338 states. [2022-04-28 08:14:39,313 INFO L87 Difference]: Start difference. First operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 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) Second operand 338 states. [2022-04-28 08:14:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:39,320 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-28 08:14:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-28 08:14:39,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:39,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:39,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:39,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 324 states have (on average 1.478395061728395) internal successors, (479), 324 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 483 transitions. [2022-04-28 08:14:39,330 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 483 transitions. Word has length 46 [2022-04-28 08:14:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:39,330 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 483 transitions. [2022-04-28 08:14:39,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:39,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 483 transitions. [2022-04-28 08:14:40,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 483 transitions. [2022-04-28 08:14:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 08:14:40,227 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:40,227 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:40,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:14:40,228 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 1 times [2022-04-28 08:14:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:40,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127618622] [2022-04-28 08:14:40,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 2 times [2022-04-28 08:14:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:40,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74784877] [2022-04-28 08:14:40,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:40,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:40,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {33031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33023#true} is VALID [2022-04-28 08:14:40,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-28 08:14:40,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-28 08:14:40,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {33023#true} call ULTIMATE.init(); {33031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:40,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {33031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33023#true} is VALID [2022-04-28 08:14:40,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-28 08:14:40,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-28 08:14:40,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {33023#true} call #t~ret59 := main(); {33023#true} is VALID [2022-04-28 08:14:40,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {33023#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {33028#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:40,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {33028#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {33029#(not (= 8528 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:40,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {33029#(not (= 8528 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(0 != 12288 + ~tmp___1~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(0 == ~s__cert~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !false; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} ~state~0 := ~s__state~0; {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(12292 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(16384 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8192 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(24576 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8195 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8480 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8481 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8482 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8464 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8465 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8466 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8496 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8497 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8512 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume !(8513 == ~s__state~0); {33030#(not (= ssl3_accept_~s__state~0 8528))} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {33030#(not (= ssl3_accept_~s__state~0 8528))} assume 8528 == ~s__state~0; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {33024#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {33024#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 4294967296);~s__s3__tmp__use_rsa_tmp~0 := 0; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {33024#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {33024#false} assume !(0 != (30 + ~l~0) % 4294967296); {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {33024#false} assume !(0 != (1 + ~l~0) % 4294967296);~skip~0 := 1; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {33024#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {33024#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {33024#false} is VALID [2022-04-28 08:14:40,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {33024#false} assume 0 == ~s__s3__tmp__reuse_message~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {33024#false} assume 0 == ~skip~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {33024#false} assume 8560 == ~state~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {33024#false} assume 8448 == ~s__state~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {33024#false} assume -1 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {33024#false} assume -2 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {33024#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {33024#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {33024#false} assume 4 != ~blastFlag~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {33024#false} assume 1024 != ~tmp___7~0; {33024#false} is VALID [2022-04-28 08:14:40,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {33024#false} assume !false; {33024#false} is VALID [2022-04-28 08:14:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:40,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74784877] [2022-04-28 08:14:40,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74784877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:40,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:40,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:40,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:40,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127618622] [2022-04-28 08:14:40,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127618622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:40,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:40,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510885543] [2022-04-28 08:14:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:40,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 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) Word has length 48 [2022-04-28 08:14:40,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:40,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:40,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:40,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:40,343 INFO L87 Difference]: Start difference. First operand 329 states and 483 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:41,204 INFO L93 Difference]: Finished difference Result 686 states and 1008 transitions. [2022-04-28 08:14:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 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) Word has length 48 [2022-04-28 08:14:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-28 08:14:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-28 08:14:41,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-28 08:14:41,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:41,573 INFO L225 Difference]: With dead ends: 686 [2022-04-28 08:14:41,573 INFO L226 Difference]: Without dead ends: 371 [2022-04-28 08:14:41,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:41,575 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 795 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:41,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 209 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-28 08:14:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 357. [2022-04-28 08:14:41,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:41,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,640 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,640 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:41,646 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-28 08:14:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-28 08:14:41,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:41,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:41,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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) Second operand 371 states. [2022-04-28 08:14:41,647 INFO L87 Difference]: Start difference. First operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 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) Second operand 371 states. [2022-04-28 08:14:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:41,654 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-28 08:14:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-28 08:14:41,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:41,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:41,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:41,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 352 states have (on average 1.4602272727272727) internal successors, (514), 352 states have internal predecessors, (514), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-04-28 08:14:41,665 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 48 [2022-04-28 08:14:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:41,665 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-04-28 08:14:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:41,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 518 transitions. [2022-04-28 08:14:42,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:42,455 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-04-28 08:14:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 08:14:42,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:42,455 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:42,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:14:42,456 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 1 times [2022-04-28 08:14:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273272903] [2022-04-28 08:14:42,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 2 times [2022-04-28 08:14:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800365243] [2022-04-28 08:14:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:42,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {35876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35868#true} is VALID [2022-04-28 08:14:42,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-28 08:14:42,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-28 08:14:42,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {35868#true} call ULTIMATE.init(); {35876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:42,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {35876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35868#true} is VALID [2022-04-28 08:14:42,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-28 08:14:42,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-28 08:14:42,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {35868#true} call #t~ret59 := main(); {35868#true} is VALID [2022-04-28 08:14:42,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {35868#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {35873#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:42,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {35873#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {35874#(not (= 8560 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:42,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {35874#(not (= 8560 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !false; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8513 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8528 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8529 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8544 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume !(8545 == ~s__state~0); {35875#(not (= 8560 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:42,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {35875#(not (= 8560 ssl3_accept_~s__state~0))} assume 8560 == ~s__state~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {35869#false} assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~ret~0 := #t~nondet46;havoc #t~nondet46; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {35869#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8576;~s__state~0 := 8448;~s__init_num~0 := 0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {35869#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {35869#false} assume 0 == ~s__s3__tmp__reuse_message~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {35869#false} assume 0 == ~skip~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {35869#false} assume 8560 == ~state~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {35869#false} assume 8448 == ~s__state~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {35869#false} assume -1 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {35869#false} assume -2 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-28 08:14:42,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {35869#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {35869#false} is VALID [2022-04-28 08:14:42,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {35869#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {35869#false} is VALID [2022-04-28 08:14:42,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {35869#false} assume 4 != ~blastFlag~0; {35869#false} is VALID [2022-04-28 08:14:42,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {35869#false} assume 1024 != ~tmp___7~0; {35869#false} is VALID [2022-04-28 08:14:42,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {35869#false} assume !false; {35869#false} is VALID [2022-04-28 08:14:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:42,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:42,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800365243] [2022-04-28 08:14:42,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800365243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:42,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:42,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:42,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:42,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273272903] [2022-04-28 08:14:42,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273272903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:42,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:42,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:42,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399448333] [2022-04-28 08:14:42,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:42,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 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) Word has length 48 [2022-04-28 08:14:42,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:42,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:42,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:42,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:42,576 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:43,423 INFO L93 Difference]: Finished difference Result 734 states and 1062 transitions. [2022-04-28 08:14:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 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) Word has length 48 [2022-04-28 08:14:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-28 08:14:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-28 08:14:43,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 538 transitions. [2022-04-28 08:14:43,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:43,782 INFO L225 Difference]: With dead ends: 734 [2022-04-28 08:14:43,782 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 08:14:43,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:43,783 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 759 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:43,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 211 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 08:14:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2022-04-28 08:14:43,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:43,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,852 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,852 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:43,862 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-28 08:14:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-28 08:14:43,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:43,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:43,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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) Second operand 391 states. [2022-04-28 08:14:43,863 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 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) Second operand 391 states. [2022-04-28 08:14:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:43,873 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-28 08:14:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-28 08:14:43,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:43,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:43,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:43,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4453125) internal successors, (555), 384 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 559 transitions. [2022-04-28 08:14:43,885 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 559 transitions. Word has length 48 [2022-04-28 08:14:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:43,886 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 559 transitions. [2022-04-28 08:14:43,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:43,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 559 transitions. [2022-04-28 08:14:44,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 559 transitions. [2022-04-28 08:14:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:14:44,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:44,907 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:44,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:14:44,907 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 1 times [2022-04-28 08:14:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:44,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642577975] [2022-04-28 08:14:44,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 2 times [2022-04-28 08:14:44,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:44,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583661389] [2022-04-28 08:14:44,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:44,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:44,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {38921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38913#true} is VALID [2022-04-28 08:14:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-28 08:14:44,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-28 08:14:44,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {38913#true} call ULTIMATE.init(); {38921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {38921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {38913#true} is VALID [2022-04-28 08:14:44,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-28 08:14:44,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-28 08:14:44,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {38913#true} call #t~ret59 := main(); {38913#true} is VALID [2022-04-28 08:14:44,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {38913#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {38918#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:44,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {38918#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {38919#(not (= 8529 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:44,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {38919#(not (= 8529 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(0 != 12288 + ~tmp___1~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(0 == ~s__cert~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !false; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} ~state~0 := ~s__state~0; {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(12292 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(16384 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8192 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(24576 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8195 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8480 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8481 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8482 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8464 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8465 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8466 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8496 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8497 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8512 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8513 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume !(8528 == ~s__state~0); {38920#(not (= ssl3_accept_~s__state~0 8529))} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {38920#(not (= ssl3_accept_~s__state~0 8529))} assume 8529 == ~s__state~0; {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {38914#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {38914#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 4294967296);~s__s3__tmp__use_rsa_tmp~0 := 0; {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {38914#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#false} assume !(0 != (30 + ~l~0) % 4294967296); {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {38914#false} assume !(0 != (1 + ~l~0) % 4294967296);~skip~0 := 1; {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {38914#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {38914#false} is VALID [2022-04-28 08:14:44,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {38914#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {38914#false} assume 0 == ~s__s3__tmp__reuse_message~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {38914#false} assume 0 == ~skip~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#false} assume 8560 == ~state~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {38914#false} assume 8448 == ~s__state~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {38914#false} assume -1 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {38914#false} assume -2 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {38914#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {38914#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {38914#false} assume 4 != ~blastFlag~0; {38914#false} is VALID [2022-04-28 08:14:44,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {38914#false} assume 1024 != ~tmp___7~0; {38914#false} is VALID [2022-04-28 08:14:44,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {38914#false} assume !false; {38914#false} is VALID [2022-04-28 08:14:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:44,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:44,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583661389] [2022-04-28 08:14:44,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583661389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:44,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:44,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:44,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:44,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642577975] [2022-04-28 08:14:44,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642577975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:44,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:44,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88895067] [2022-04-28 08:14:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) Word has length 49 [2022-04-28 08:14:44,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:44,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:45,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:45,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:45,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:45,020 INFO L87 Difference]: Start difference. First operand 389 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:45,960 INFO L93 Difference]: Finished difference Result 778 states and 1123 transitions. [2022-04-28 08:14:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:45,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) Word has length 49 [2022-04-28 08:14:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-28 08:14:45,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-28 08:14:45,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 554 transitions. [2022-04-28 08:14:46,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 554 edges. 554 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:46,335 INFO L225 Difference]: With dead ends: 778 [2022-04-28 08:14:46,335 INFO L226 Difference]: Without dead ends: 403 [2022-04-28 08:14:46,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:46,336 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 795 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:46,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 210 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-28 08:14:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2022-04-28 08:14:46,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:46,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:46,414 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:46,414 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:46,423 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-28 08:14:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-28 08:14:46,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:46,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:46,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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) Second operand 403 states. [2022-04-28 08:14:46,425 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 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) Second operand 403 states. [2022-04-28 08:14:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:46,434 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-28 08:14:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-28 08:14:46,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:46,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:46,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:46,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4375) internal successors, (552), 384 states have internal predecessors, (552), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 556 transitions. [2022-04-28 08:14:46,447 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 556 transitions. Word has length 49 [2022-04-28 08:14:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:46,447 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 556 transitions. [2022-04-28 08:14:46,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:46,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 556 transitions. [2022-04-28 08:14:47,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 556 transitions. [2022-04-28 08:14:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:14:47,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:47,344 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:47,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:14:47,344 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 1 times [2022-04-28 08:14:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:47,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701809274] [2022-04-28 08:14:47,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 2 times [2022-04-28 08:14:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:47,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555829350] [2022-04-28 08:14:47,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:47,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {42078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42070#true} is VALID [2022-04-28 08:14:47,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-28 08:14:47,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-28 08:14:47,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {42070#true} call ULTIMATE.init(); {42078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:47,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {42078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {42070#true} is VALID [2022-04-28 08:14:47,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-28 08:14:47,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-28 08:14:47,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {42070#true} call #t~ret59 := main(); {42070#true} is VALID [2022-04-28 08:14:47,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {42070#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {42075#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:47,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {42075#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {42076#(not (= |ssl3_accept_#in~initial_state| 8561))} is VALID [2022-04-28 08:14:47,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {42076#(not (= |ssl3_accept_#in~initial_state| 8561))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(0 != 12288 + ~tmp___1~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(0 == ~s__cert~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !false; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} ~state~0 := ~s__state~0; {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(12292 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(16384 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8192 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(24576 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8195 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8480 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8481 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8482 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8464 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8465 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8466 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8496 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8497 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8512 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8513 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8528 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8529 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,419 INFO L290 TraceCheckUtils]: 31: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8544 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8545 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume !(8560 == ~s__state~0); {42077#(not (= ssl3_accept_~s__state~0 8561))} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {42077#(not (= ssl3_accept_~s__state~0 8561))} assume 8561 == ~s__state~0; {42071#false} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {42071#false} assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~ret~0 := #t~nondet46;havoc #t~nondet46; {42071#false} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {42071#false} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8576;~s__state~0 := 8448;~s__init_num~0 := 0; {42071#false} is VALID [2022-04-28 08:14:47,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {42071#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {42071#false} assume 0 == ~s__s3__tmp__reuse_message~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {42071#false} assume 0 == ~skip~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {42071#false} assume 8560 == ~state~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {42071#false} assume 8448 == ~s__state~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {42071#false} assume -1 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {42071#false} assume -2 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {42071#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {42071#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {42071#false} assume 4 != ~blastFlag~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {42071#false} assume 1024 != ~tmp___7~0; {42071#false} is VALID [2022-04-28 08:14:47,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {42071#false} assume !false; {42071#false} is VALID [2022-04-28 08:14:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555829350] [2022-04-28 08:14:47,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555829350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:47,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:47,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:47,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701809274] [2022-04-28 08:14:47,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701809274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:47,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:47,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387263986] [2022-04-28 08:14:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) Word has length 49 [2022-04-28 08:14:47,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:47,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:47,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:47,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:47,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:47,457 INFO L87 Difference]: Start difference. First operand 389 states and 556 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:48,329 INFO L93 Difference]: Finished difference Result 768 states and 1100 transitions. [2022-04-28 08:14:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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) Word has length 49 [2022-04-28 08:14:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-28 08:14:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-28 08:14:48,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 539 transitions. [2022-04-28 08:14:48,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:48,695 INFO L225 Difference]: With dead ends: 768 [2022-04-28 08:14:48,695 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 08:14:48,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:48,696 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 746 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:48,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 217 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 08:14:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2022-04-28 08:14:48,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:48,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,784 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,785 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:48,794 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-28 08:14:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-28 08:14:48,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:48,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:48,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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) Second operand 393 states. [2022-04-28 08:14:48,795 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 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) Second operand 393 states. [2022-04-28 08:14:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:48,804 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-28 08:14:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-28 08:14:48,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:48,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:48,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:48,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4378238341968912) internal successors, (555), 386 states have internal predecessors, (555), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 559 transitions. [2022-04-28 08:14:48,817 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 559 transitions. Word has length 49 [2022-04-28 08:14:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:48,817 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 559 transitions. [2022-04-28 08:14:48,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:48,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 559 transitions. [2022-04-28 08:14:49,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:49,725 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 559 transitions. [2022-04-28 08:14:49,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 08:14:49,726 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:49,726 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:49,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:14:49,726 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 1 times [2022-04-28 08:14:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778069979] [2022-04-28 08:14:49,727 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 2 times [2022-04-28 08:14:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347402551] [2022-04-28 08:14:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:49,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:49,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {45199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45191#true} is VALID [2022-04-28 08:14:49,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-28 08:14:49,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-28 08:14:49,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {45191#true} call ULTIMATE.init(); {45199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:49,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {45199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {45191#true} is VALID [2022-04-28 08:14:49,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-28 08:14:49,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-28 08:14:49,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {45191#true} call #t~ret59 := main(); {45191#true} is VALID [2022-04-28 08:14:49,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {45191#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {45196#(<= 8464 main_~s~0)} is VALID [2022-04-28 08:14:49,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {45196#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {45197#(not (= 8448 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:49,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {45197#(not (= 8448 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(0 != 12288 + ~tmp___1~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(0 == ~s__cert~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !false; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} ~state~0 := ~s__state~0; {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(12292 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(16384 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8192 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(24576 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8195 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8480 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8481 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8482 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8464 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8465 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8466 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8496 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8497 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8512 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8513 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8528 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8529 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8544 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8545 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8560 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume !(8561 == ~s__state~0); {45198#(not (= 8448 ssl3_accept_~s__state~0))} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {45198#(not (= 8448 ssl3_accept_~s__state~0))} assume 8448 == ~s__state~0; {45192#false} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {45192#false} assume !(~num1~0 > 0); {45192#false} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {45192#false} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {45192#false} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {45192#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {45192#false} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {45192#false} assume 0 == ~s__s3__tmp__reuse_message~0; {45192#false} is VALID [2022-04-28 08:14:49,799 INFO L290 TraceCheckUtils]: 40: Hoare triple {45192#false} assume 0 == ~skip~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {45192#false} assume 8560 == ~state~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {45192#false} assume 8448 == ~s__state~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {45192#false} assume -1 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {45192#false} assume -2 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {45192#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {45192#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {45192#false} assume 4 != ~blastFlag~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {45192#false} assume 1024 != ~tmp___7~0; {45192#false} is VALID [2022-04-28 08:14:49,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {45192#false} assume !false; {45192#false} is VALID [2022-04-28 08:14:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347402551] [2022-04-28 08:14:49,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347402551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:49,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:49,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:49,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778069979] [2022-04-28 08:14:49,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778069979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:49,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:49,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207630054] [2022-04-28 08:14:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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) Word has length 50 [2022-04-28 08:14:49,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:49,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:49,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:49,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:49,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:49,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:49,837 INFO L87 Difference]: Start difference. First operand 391 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:50,727 INFO L93 Difference]: Finished difference Result 832 states and 1196 transitions. [2022-04-28 08:14:50,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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) Word has length 50 [2022-04-28 08:14:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-28 08:14:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-28 08:14:50,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-28 08:14:51,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 552 edges. 552 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:51,107 INFO L225 Difference]: With dead ends: 832 [2022-04-28 08:14:51,107 INFO L226 Difference]: Without dead ends: 455 [2022-04-28 08:14:51,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:51,108 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 739 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:51,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 213 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-28 08:14:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-04-28 08:14:51,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:51,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:51,214 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:51,214 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:51,222 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-28 08:14:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-28 08:14:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:51,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:51,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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) Second operand 455 states. [2022-04-28 08:14:51,223 INFO L87 Difference]: Start difference. First operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 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) Second operand 455 states. [2022-04-28 08:14:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:51,234 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-28 08:14:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-28 08:14:51,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:51,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:51,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:51,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 448 states have (on average 1.4308035714285714) internal successors, (641), 448 states have internal predecessors, (641), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 645 transitions. [2022-04-28 08:14:51,245 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 645 transitions. Word has length 50 [2022-04-28 08:14:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:51,245 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 645 transitions. [2022-04-28 08:14:51,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:51,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 453 states and 645 transitions. [2022-04-28 08:14:52,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 645 edges. 645 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 645 transitions. [2022-04-28 08:14:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 08:14:52,311 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:52,311 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:14:52,311 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:52,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 1 times [2022-04-28 08:14:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811346631] [2022-04-28 08:14:52,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 2 times [2022-04-28 08:14:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:52,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120575915] [2022-04-28 08:14:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:52,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {48696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48688#true} is VALID [2022-04-28 08:14:52,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-28 08:14:52,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-28 08:14:52,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {48688#true} call ULTIMATE.init(); {48696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:52,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {48696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {48688#true} is VALID [2022-04-28 08:14:52,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-28 08:14:52,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-28 08:14:52,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {48688#true} call #t~ret59 := main(); {48688#true} is VALID [2022-04-28 08:14:52,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {48688#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {48693#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:52,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {48693#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {48694#(not (= 8640 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:52,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {48694#(not (= 8640 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(0 != 12288 + ~tmp___1~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(0 == ~s__cert~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !false; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} ~state~0 := ~s__state~0; {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(12292 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(16384 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8192 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(24576 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8195 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8480 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8481 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8482 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8464 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8465 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8466 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8496 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8497 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8512 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8513 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8528 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8529 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8544 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8545 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8560 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8561 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8448 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8576 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8577 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8592 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8593 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8608 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume !(8609 == ~s__state~0); {48695#(not (= ssl3_accept_~s__state~0 8640))} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {48695#(not (= ssl3_accept_~s__state~0 8640))} assume 8640 == ~s__state~0; {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {48689#false} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {48689#false} assume !(9 == ~blastFlag~0); {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {48689#false} assume !(12 == ~blastFlag~0); {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {48689#false} assume !(15 == ~blastFlag~0); {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {48689#false} assume !(18 == ~blastFlag~0); {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {48689#false} assume 21 == ~blastFlag~0; {48689#false} is VALID [2022-04-28 08:14:52,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {48689#false} assume !false; {48689#false} is VALID [2022-04-28 08:14:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:52,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120575915] [2022-04-28 08:14:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120575915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:52,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:52,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:52,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:52,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811346631] [2022-04-28 08:14:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811346631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:52,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253058331] [2022-04-28 08:14:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:52,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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) Word has length 50 [2022-04-28 08:14:52,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:52,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:52,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:52,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:52,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:52,425 INFO L87 Difference]: Start difference. First operand 453 states and 645 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:53,318 INFO L93 Difference]: Finished difference Result 944 states and 1344 transitions. [2022-04-28 08:14:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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) Word has length 50 [2022-04-28 08:14:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-28 08:14:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-28 08:14:53,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 567 transitions. [2022-04-28 08:14:53,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:53,713 INFO L225 Difference]: With dead ends: 944 [2022-04-28 08:14:53,713 INFO L226 Difference]: Without dead ends: 505 [2022-04-28 08:14:53,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:53,714 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 809 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:53,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 212 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-28 08:14:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 495. [2022-04-28 08:14:53,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:53,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,817 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,817 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:53,826 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-28 08:14:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-28 08:14:53,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:53,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:53,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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) Second operand 505 states. [2022-04-28 08:14:53,827 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 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) Second operand 505 states. [2022-04-28 08:14:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:53,841 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-28 08:14:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-28 08:14:53,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:53,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:53,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:53,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.4224489795918367) internal successors, (697), 490 states have internal predecessors, (697), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 701 transitions. [2022-04-28 08:14:53,857 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 701 transitions. Word has length 50 [2022-04-28 08:14:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:53,857 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 701 transitions. [2022-04-28 08:14:53,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:53,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 701 transitions. [2022-04-28 08:14:55,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 701 transitions. [2022-04-28 08:14:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 08:14:55,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:55,050 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:55,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:14:55,050 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 1 times [2022-04-28 08:14:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590178699] [2022-04-28 08:14:55,050 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 2 times [2022-04-28 08:14:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:55,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10774946] [2022-04-28 08:14:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:55,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {52601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52593#true} is VALID [2022-04-28 08:14:55,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-28 08:14:55,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-28 08:14:55,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {52593#true} call ULTIMATE.init(); {52601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:55,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {52601#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {52593#true} is VALID [2022-04-28 08:14:55,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-28 08:14:55,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-28 08:14:55,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {52593#true} call #t~ret59 := main(); {52593#true} is VALID [2022-04-28 08:14:55,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {52593#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {52598#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:55,109 INFO L272 TraceCheckUtils]: 6: Hoare triple {52598#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {52599#(not (= 8641 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:14:55,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {52599#(not (= 8641 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(0 != 12288 + ~tmp___1~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(0 == ~s__cert~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !false; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} ~state~0 := ~s__state~0; {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(12292 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(16384 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8192 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(24576 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8195 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8480 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8481 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8482 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8464 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8465 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8466 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8496 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8497 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8512 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8513 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8528 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8529 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8544 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8545 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8560 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8561 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8448 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8576 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8577 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8592 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8593 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8608 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8609 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume !(8640 == ~s__state~0); {52600#(not (= ssl3_accept_~s__state~0 8641))} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {52600#(not (= ssl3_accept_~s__state~0 8641))} assume 8641 == ~s__state~0; {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {52594#false} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 45: Hoare triple {52594#false} assume !(9 == ~blastFlag~0); {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {52594#false} assume !(12 == ~blastFlag~0); {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 47: Hoare triple {52594#false} assume !(15 == ~blastFlag~0); {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 48: Hoare triple {52594#false} assume !(18 == ~blastFlag~0); {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 49: Hoare triple {52594#false} assume 21 == ~blastFlag~0; {52594#false} is VALID [2022-04-28 08:14:55,121 INFO L290 TraceCheckUtils]: 50: Hoare triple {52594#false} assume !false; {52594#false} is VALID [2022-04-28 08:14:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:55,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10774946] [2022-04-28 08:14:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10774946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:55,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:55,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:55,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:55,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590178699] [2022-04-28 08:14:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590178699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:55,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:55,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904681656] [2022-04-28 08:14:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:55,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 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) Word has length 51 [2022-04-28 08:14:55,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:55,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:55,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:55,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:55,158 INFO L87 Difference]: Start difference. First operand 495 states and 701 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:56,161 INFO L93 Difference]: Finished difference Result 995 states and 1416 transitions. [2022-04-28 08:14:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:56,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 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) Word has length 51 [2022-04-28 08:14:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-28 08:14:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-28 08:14:56,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-28 08:14:56,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:56,547 INFO L225 Difference]: With dead ends: 995 [2022-04-28 08:14:56,548 INFO L226 Difference]: Without dead ends: 514 [2022-04-28 08:14:56,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:56,549 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 812 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:56,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 212 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-04-28 08:14:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2022-04-28 08:14:56,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:56,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,668 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,668 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:56,679 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-28 08:14:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-28 08:14:56,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:56,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:56,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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) Second operand 514 states. [2022-04-28 08:14:56,680 INFO L87 Difference]: Start difference. First operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 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) Second operand 514 states. [2022-04-28 08:14:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:56,689 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-28 08:14:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-28 08:14:56,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:56,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:56,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:56,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.4288577154308617) internal successors, (713), 499 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 717 transitions. [2022-04-28 08:14:56,704 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 717 transitions. Word has length 51 [2022-04-28 08:14:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:56,704 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 717 transitions. [2022-04-28 08:14:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:56,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 717 transitions. [2022-04-28 08:14:57,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 717 transitions. [2022-04-28 08:14:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:14:57,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:14:57,939 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:14:57,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:14:57,939 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:14:57,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:14:57,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 1 times [2022-04-28 08:14:57,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:57,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720320134] [2022-04-28 08:14:57,940 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:14:57,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 2 times [2022-04-28 08:14:57,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:14:57,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49610913] [2022-04-28 08:14:57,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:14:57,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:14:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:14:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:14:58,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {56644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {56636#true} is VALID [2022-04-28 08:14:58,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-28 08:14:58,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-28 08:14:58,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {56636#true} call ULTIMATE.init(); {56644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:14:58,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {56644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {56636#true} is VALID [2022-04-28 08:14:58,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-28 08:14:58,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-28 08:14:58,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {56636#true} call #t~ret59 := main(); {56636#true} is VALID [2022-04-28 08:14:58,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {56636#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {56641#(<= main_~s~0 8464)} is VALID [2022-04-28 08:14:58,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {56641#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {56642#(not (= |ssl3_accept_#in~initial_state| 8672))} is VALID [2022-04-28 08:14:58,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {56642#(not (= |ssl3_accept_#in~initial_state| 8672))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(0 != 12288 + ~tmp___1~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(0 == ~s__cert~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !false; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} ~state~0 := ~s__state~0; {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(12292 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(16384 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8192 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(24576 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8195 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8480 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8481 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8482 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8464 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8465 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8466 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8496 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8497 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8512 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8513 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8528 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8529 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8544 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8545 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8560 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8561 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8448 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8576 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8577 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8592 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8593 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8608 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,020 INFO L290 TraceCheckUtils]: 41: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8609 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8640 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,021 INFO L290 TraceCheckUtils]: 43: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8641 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,021 INFO L290 TraceCheckUtils]: 44: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8656 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume !(8657 == ~s__state~0); {56643#(not (= ssl3_accept_~s__state~0 8672))} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {56643#(not (= ssl3_accept_~s__state~0 8672))} assume 8672 == ~s__state~0; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {56637#false} assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~ret~0 := #t~nondet53;havoc #t~nondet53; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {56637#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {56637#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {56637#false} assume 0 != ~s__hit~0;~s__s3__tmp__next_state___0~0 := 8640; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 51: Hoare triple {56637#false} ~s__init_num~0 := 0; {56637#false} is VALID [2022-04-28 08:14:58,022 INFO L290 TraceCheckUtils]: 52: Hoare triple {56637#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {56637#false} assume 0 == ~s__s3__tmp__reuse_message~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {56637#false} assume 0 == ~skip~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {56637#false} assume 8560 == ~state~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {56637#false} assume 8448 == ~s__state~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {56637#false} assume -1 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {56637#false} assume -2 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {56637#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {56637#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {56637#false} assume 4 != ~blastFlag~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {56637#false} assume 1024 != ~tmp___7~0; {56637#false} is VALID [2022-04-28 08:14:58,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {56637#false} assume !false; {56637#false} is VALID [2022-04-28 08:14:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:14:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:14:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49610913] [2022-04-28 08:14:58,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49610913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:58,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:58,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:58,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:14:58,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720320134] [2022-04-28 08:14:58,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720320134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:14:58,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:14:58,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:14:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494787806] [2022-04-28 08:14:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:14:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 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) Word has length 64 [2022-04-28 08:14:58,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:14:58,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:58,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:14:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:14:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:14:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:14:58,076 INFO L87 Difference]: Start difference. First operand 504 states and 717 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:58,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:58,969 INFO L93 Difference]: Finished difference Result 1045 states and 1487 transitions. [2022-04-28 08:14:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:14:58,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 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) Word has length 64 [2022-04-28 08:14:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:14:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-28 08:14:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-28 08:14:58,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-28 08:14:59,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:14:59,369 INFO L225 Difference]: With dead ends: 1045 [2022-04-28 08:14:59,369 INFO L226 Difference]: Without dead ends: 555 [2022-04-28 08:14:59,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:14:59,370 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 807 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:14:59,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 213 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:14:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-28 08:14:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 549. [2022-04-28 08:14:59,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:14:59,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:59,519 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:59,520 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:59,535 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-28 08:14:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-28 08:14:59,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:59,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:59,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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) Second operand 555 states. [2022-04-28 08:14:59,537 INFO L87 Difference]: Start difference. First operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 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) Second operand 555 states. [2022-04-28 08:14:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:14:59,553 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-28 08:14:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-28 08:14:59,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:14:59,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:14:59,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:14:59,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:14:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 544 states have internal predecessors, (773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 777 transitions. [2022-04-28 08:14:59,582 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 777 transitions. Word has length 64 [2022-04-28 08:14:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:14:59,582 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 777 transitions. [2022-04-28 08:14:59,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:14:59,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 549 states and 777 transitions. [2022-04-28 08:15:00,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 777 edges. 777 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 777 transitions. [2022-04-28 08:15:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:15:00,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:00,967 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:15:00,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:15:00,967 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 1 times [2022-04-28 08:15:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [148778341] [2022-04-28 08:15:00,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:15:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 2 times [2022-04-28 08:15:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:15:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283949652] [2022-04-28 08:15:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:15:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:15:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:15:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:15:01,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {60959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60951#true} is VALID [2022-04-28 08:15:01,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-28 08:15:01,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-28 08:15:01,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {60951#true} call ULTIMATE.init(); {60959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:15:01,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {60959#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {60951#true} is VALID [2022-04-28 08:15:01,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-28 08:15:01,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-28 08:15:01,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {60951#true} call #t~ret59 := main(); {60951#true} is VALID [2022-04-28 08:15:01,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {60951#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {60956#(<= main_~s~0 8464)} is VALID [2022-04-28 08:15:01,043 INFO L272 TraceCheckUtils]: 6: Hoare triple {60956#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {60957#(not (= 8673 |ssl3_accept_#in~initial_state|))} is VALID [2022-04-28 08:15:01,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {60957#(not (= 8673 |ssl3_accept_#in~initial_state|))} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___8~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___9~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___10~0 := #t~nondet28;havoc #t~nondet28;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;~__cil_tmp61~0 := #t~nondet29;havoc #t~nondet29;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(0 != 12288 + ~tmp___1~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(0 == ~s__cert~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !false; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} ~state~0 := ~s__state~0; {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(12292 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(16384 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8192 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(24576 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8195 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8480 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8481 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8482 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8464 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8465 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8466 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8496 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8497 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8512 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8513 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8528 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8529 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,055 INFO L290 TraceCheckUtils]: 31: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8544 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8545 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8560 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8561 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8448 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8576 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8577 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8592 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8593 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8608 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8609 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8640 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8641 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8656 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8657 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume !(8672 == ~s__state~0); {60958#(not (= ssl3_accept_~s__state~0 8673))} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {60958#(not (= ssl3_accept_~s__state~0 8673))} assume 8673 == ~s__state~0; {60952#false} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {60952#false} assume -2147483648 <= #t~nondet53 && #t~nondet53 <= 2147483647;~ret~0 := #t~nondet53;havoc #t~nondet53; {60952#false} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {60952#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {60952#false} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {60952#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {60952#false} is VALID [2022-04-28 08:15:01,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {60952#false} assume 0 != ~s__hit~0;~s__s3__tmp__next_state___0~0 := 8640; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {60952#false} ~s__init_num~0 := 0; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {60952#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {60952#false} assume 0 == ~s__s3__tmp__reuse_message~0; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 55: Hoare triple {60952#false} assume 0 == ~skip~0; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 56: Hoare triple {60952#false} assume 8560 == ~state~0; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 57: Hoare triple {60952#false} assume 8448 == ~s__state~0; {60952#false} is VALID [2022-04-28 08:15:01,062 INFO L290 TraceCheckUtils]: 58: Hoare triple {60952#false} assume -1 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {60952#false} assume -2 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 60: Hoare triple {60952#false} assume 9021 != ~__cil_tmp61~0 % 4294967296; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {60952#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {60952#false} assume 4 != ~blastFlag~0; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {60952#false} assume 1024 != ~tmp___7~0; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {60952#false} assume !false; {60952#false} is VALID [2022-04-28 08:15:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:15:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:15:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283949652] [2022-04-28 08:15:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283949652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:01,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:15:01,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:15:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [148778341] [2022-04-28 08:15:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [148778341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:15:01,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:15:01,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:15:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741182830] [2022-04-28 08:15:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:15:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 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) Word has length 65 [2022-04-28 08:15:01,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:15:01,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:01,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:01,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:15:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:15:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:15:01,119 INFO L87 Difference]: Start difference. First operand 549 states and 777 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:02,252 INFO L93 Difference]: Finished difference Result 1094 states and 1553 transitions. [2022-04-28 08:15:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:15:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 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) Word has length 65 [2022-04-28 08:15:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:15:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-28 08:15:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-28 08:15:02,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 570 transitions. [2022-04-28 08:15:02,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:02,645 INFO L225 Difference]: With dead ends: 1094 [2022-04-28 08:15:02,645 INFO L226 Difference]: Without dead ends: 557 [2022-04-28 08:15:02,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 08:15:02,647 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 815 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:15:02,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 211 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 08:15:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-28 08:15:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 551. [2022-04-28 08:15:02,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:15:02,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,767 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:02,782 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-28 08:15:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-28 08:15:02,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:02,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:02,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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) Second operand 557 states. [2022-04-28 08:15:02,790 INFO L87 Difference]: Start difference. First operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 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) Second operand 557 states. [2022-04-28 08:15:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:15:02,805 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-28 08:15:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-28 08:15:02,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:15:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:15:02,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:15:02,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:15:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 546 states have internal predecessors, (776), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 780 transitions. [2022-04-28 08:15:02,828 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 780 transitions. Word has length 65 [2022-04-28 08:15:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:15:02,828 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 780 transitions. [2022-04-28 08:15:02,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:15:02,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 780 transitions. [2022-04-28 08:15:04,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 780 edges. 780 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:15:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 780 transitions. [2022-04-28 08:15:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 08:15:04,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:15:04,235 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:15:04,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:15:04,235 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:15:04,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:15:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1606826053, now seen corresponding path program 1 times [2022-04-28 08:15:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:15:04,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262542903] [2022-04-28 08:15:04,625 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:15:04,632 INFO L158 Benchmark]: Toolchain (without parser) took 59218.01ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 124.8MB in the beginning and 220.1MB in the end (delta: -95.3MB). Peak memory consumption was 53.0MB. Max. memory is 8.0GB. [2022-04-28 08:15:04,632 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory was 142.1MB in the beginning and 142.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:15:04,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.53ms. Allocated memory is still 175.1MB. Free memory was 124.6MB in the beginning and 145.0MB in the end (delta: -20.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-28 08:15:04,633 INFO L158 Benchmark]: Boogie Preprocessor took 75.95ms. Allocated memory is still 175.1MB. Free memory was 144.7MB in the beginning and 141.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-28 08:15:04,633 INFO L158 Benchmark]: RCFGBuilder took 802.14ms. Allocated memory is still 175.1MB. Free memory was 141.8MB in the beginning and 102.4MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-04-28 08:15:04,633 INFO L158 Benchmark]: TraceAbstraction took 57870.46ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 101.7MB in the beginning and 220.6MB in the end (delta: -118.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-04-28 08:15:04,636 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory was 142.1MB in the beginning and 142.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 463.53ms. Allocated memory is still 175.1MB. Free memory was 124.6MB in the beginning and 145.0MB in the end (delta: -20.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.95ms. Allocated memory is still 175.1MB. Free memory was 144.7MB in the beginning and 141.8MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 802.14ms. Allocated memory is still 175.1MB. Free memory was 141.8MB in the beginning and 102.4MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 57870.46ms. Allocated memory was 175.1MB in the beginning and 323.0MB in the end (delta: 147.8MB). Free memory was 101.7MB in the beginning and 220.6MB in the end (delta: -118.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula.: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:15:04,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...