/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:49:00,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:49:00,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:49:00,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:49:00,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:49:00,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:49:00,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:49:00,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:49:00,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:49:00,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:49:00,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:49:00,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:49:00,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:49:00,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:49:00,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:49:00,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:49:00,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:49:00,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:49:00,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:49:00,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:49:00,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:49:00,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:49:00,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:49:00,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:49:00,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:49:00,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:49:00,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:49:00,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:49:00,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:49:00,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:49:00,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:49:00,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:49:00,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:49:00,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:49:00,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:49:00,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:49:00,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:49:00,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:49:00,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:49:00,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:49:00,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:49:00,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:49:00,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:49:00,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:49:00,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:49:00,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:49:00,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:49:00,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:49:00,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:49:00,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:49:00,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:49:00,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:49:00,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:49:00,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:49:00,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:49:00,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:49:00,786 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:49:00,786 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:49:00,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:49:00,786 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:49:00,786 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-15 17:49:00,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:49:01,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:49:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:49:01,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:49:01,021 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:49:01,022 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-15 17:49:01,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d886333/39848becfc744028b41e03703f53096a/FLAGc0de4df62 [2022-04-15 17:49:01,408 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:49:01,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_12.cil.c [2022-04-15 17:49:01,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d886333/39848becfc744028b41e03703f53096a/FLAGc0de4df62 [2022-04-15 17:49:01,805 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d886333/39848becfc744028b41e03703f53096a [2022-04-15 17:49:01,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:49:01,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:49:01,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:49:01,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:49:01,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:49:01,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:49:01" (1/1) ... [2022-04-15 17:49:01,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5734a923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:01, skipping insertion in model container [2022-04-15 17:49:01,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:49:01" (1/1) ... [2022-04-15 17:49:01,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:49:01,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:49:02,072 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-15 17:49:02,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:49:02,087 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:49:02,153 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-15 17:49:02,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:49:02,168 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:49:02,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02 WrapperNode [2022-04-15 17:49:02,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:49:02,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:49:02,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:49:02,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:49:02,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:49:02,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:49:02,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:49:02,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:49:02,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (1/1) ... [2022-04-15 17:49:02,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:49:02,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:49:02,261 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-15 17:49:02,281 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-15 17:49:02,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:49:02,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:49:02,302 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:49:02,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 17:49:02,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 17:49:02,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:49:02,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:49:02,394 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:49:02,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:49:02,474 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:49:03,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-15 17:49:03,002 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-15 17:49:03,011 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:49:03,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:49:03,023 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:49:03,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:49:03 BoogieIcfgContainer [2022-04-15 17:49:03,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:49:03,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:49:03,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:49:03,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:49:03,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:49:01" (1/3) ... [2022-04-15 17:49:03,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311f5314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:49:03, skipping insertion in model container [2022-04-15 17:49:03,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:02" (2/3) ... [2022-04-15 17:49:03,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311f5314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:49:03, skipping insertion in model container [2022-04-15 17:49:03,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:49:03" (3/3) ... [2022-04-15 17:49:03,035 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2022-04-15 17:49:03,039 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:49:03,040 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:49:03,129 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:49:03,137 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 17:49:03,137 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:49:03,175 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-15 17:49:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 17:49:03,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:03,185 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:03,186 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 1 times [2022-04-15 17:49:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:03,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1296637518] [2022-04-15 17:49:03,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1199187261, now seen corresponding path program 2 times [2022-04-15 17:49:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:03,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423170805] [2022-04-15 17:49:03,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:03,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:03,547 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-15 17:49:03,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 17:49:03,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-15 17:49:03,549 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-15 17:49:03,550 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-15 17:49:03,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#true} assume true; {179#true} is VALID [2022-04-15 17:49:03,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {179#true} {179#true} #752#return; {179#true} is VALID [2022-04-15 17:49:03,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {179#true} call #t~ret59 := main(); {179#true} is VALID [2022-04-15 17:49:03,551 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-15 17:49:03,552 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-15 17:49:03,555 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:03,556 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-15 17:49:03,558 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-15 17:49:03,561 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-15 17:49:03,562 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-15 17:49:03,563 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-15 17:49:03,564 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-15 17:49:03,564 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-15 17:49:03,565 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-15 17:49:03,566 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-15 17:49:03,567 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-15 17:49:03,567 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-15 17:49:03,568 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-15 17:49:03,568 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-15 17:49:03,568 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-15 17:49:03,568 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-15 17:49:03,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {180#false} assume 0 == ~s__s3__tmp__reuse_message~0; {180#false} is VALID [2022-04-15 17:49:03,569 INFO L290 TraceCheckUtils]: 24: Hoare triple {180#false} assume 0 == ~skip~0; {180#false} is VALID [2022-04-15 17:49:03,569 INFO L290 TraceCheckUtils]: 25: Hoare triple {180#false} assume 8560 == ~state~0; {180#false} is VALID [2022-04-15 17:49:03,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {180#false} assume 8448 == ~s__state~0; {180#false} is VALID [2022-04-15 17:49:03,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {180#false} assume -1 != ~s__verify_mode~0; {180#false} is VALID [2022-04-15 17:49:03,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {180#false} assume -2 != ~s__verify_mode~0; {180#false} is VALID [2022-04-15 17:49:03,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {180#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {180#false} is VALID [2022-04-15 17:49:03,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {180#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {180#false} is VALID [2022-04-15 17:49:03,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {180#false} assume 4 != ~blastFlag~0; {180#false} is VALID [2022-04-15 17:49:03,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {180#false} assume 1024 != ~tmp___7~0; {180#false} is VALID [2022-04-15 17:49:03,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {180#false} assume !false; {180#false} is VALID [2022-04-15 17:49:03,571 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-15 17:49:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:03,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423170805] [2022-04-15 17:49:03,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423170805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:03,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:03,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:03,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1296637518] [2022-04-15 17:49:03,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1296637518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:03,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:03,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735217359] [2022-04-15 17:49:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:03,582 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-15 17:49:03,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:03,586 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-15 17:49:03,621 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-15 17:49:03,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:03,656 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-15 17:49:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:05,092 INFO L93 Difference]: Finished difference Result 363 states and 624 transitions. [2022-04-15 17:49:05,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:05,092 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-15 17:49:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:05,094 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-15 17:49:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-15 17:49:05,108 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-15 17:49:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-04-15 17:49:05,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 624 transitions. [2022-04-15 17:49:05,625 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-15 17:49:05,645 INFO L225 Difference]: With dead ends: 363 [2022-04-15 17:49:05,646 INFO L226 Difference]: Without dead ends: 180 [2022-04-15 17:49:05,650 INFO L912 BasicCegarLoop]: 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-15 17:49:05,655 INFO L913 BasicCegarLoop]: 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.5s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:05,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 258 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 17:49:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-15 17:49:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-04-15 17:49:05,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:05,725 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-15 17:49:05,726 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-15 17:49:05,731 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-15 17:49:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:05,742 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-15 17:49:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-15 17:49:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:05,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:05,751 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-15 17:49:05,751 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-15 17:49:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:05,760 INFO L93 Difference]: Finished difference Result 180 states and 285 transitions. [2022-04-15 17:49:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-04-15 17:49:05,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:05,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:05,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:05,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:05,763 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-15 17:49:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 283 transitions. [2022-04-15 17:49:05,772 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 283 transitions. Word has length 34 [2022-04-15 17:49:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:05,773 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 283 transitions. [2022-04-15 17:49:05,773 INFO L479 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-15 17:49:05,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 283 transitions. [2022-04-15 17:49:06,041 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-15 17:49:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 283 transitions. [2022-04-15 17:49:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 17:49:06,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:06,043 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:06,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:49:06,043 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 1 times [2022-04-15 17:49:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:06,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335869236] [2022-04-15 17:49:06,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -576860, now seen corresponding path program 2 times [2022-04-15 17:49:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410728211] [2022-04-15 17:49:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:06,181 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-15 17:49:06,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 17:49:06,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-15 17:49:06,182 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-15 17:49:06,182 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-15 17:49:06,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1638#true} assume true; {1638#true} is VALID [2022-04-15 17:49:06,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1638#true} {1638#true} #752#return; {1638#true} is VALID [2022-04-15 17:49:06,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {1638#true} call #t~ret59 := main(); {1638#true} is VALID [2022-04-15 17:49:06,184 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-15 17:49:06,185 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-15 17:49:06,187 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:06,187 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-15 17:49:06,190 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-15 17:49:06,190 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-15 17:49:06,191 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-15 17:49:06,191 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-15 17:49:06,192 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-15 17:49:06,192 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-15 17:49:06,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1639#false} ~s__new_session~0 := 1; {1639#false} is VALID [2022-04-15 17:49:06,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1639#false} ~s__server~0 := 1; {1639#false} is VALID [2022-04-15 17:49:06,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {1639#false} assume 0 != ~cb~0; {1639#false} is VALID [2022-04-15 17:49:06,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {1639#false} is VALID [2022-04-15 17:49:06,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {1639#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1639#false} is VALID [2022-04-15 17:49:06,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {1639#false} assume !(0 == ~s__init_buf___0~0); {1639#false} is VALID [2022-04-15 17:49:06,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {1639#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1639#false} is VALID [2022-04-15 17:49:06,197 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-15 17:49:06,197 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-15 17:49:06,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#false} assume 0 == ~s__s3__tmp__reuse_message~0; {1639#false} is VALID [2022-04-15 17:49:06,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {1639#false} assume 0 == ~skip~0; {1639#false} is VALID [2022-04-15 17:49:06,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {1639#false} assume 8560 == ~state~0; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {1639#false} assume 8448 == ~s__state~0; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {1639#false} assume -1 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {1639#false} assume -2 != ~s__verify_mode~0; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {1639#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {1639#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {1639#false} is VALID [2022-04-15 17:49:06,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {1639#false} assume 4 != ~blastFlag~0; {1639#false} is VALID [2022-04-15 17:49:06,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {1639#false} assume 1024 != ~tmp___7~0; {1639#false} is VALID [2022-04-15 17:49:06,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {1639#false} assume !false; {1639#false} is VALID [2022-04-15 17:49:06,199 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-15 17:49:06,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:06,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410728211] [2022-04-15 17:49:06,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410728211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:06,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:06,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:06,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335869236] [2022-04-15 17:49:06,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335869236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:06,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:06,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:06,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700883962] [2022-04-15 17:49:06,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:06,207 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-15 17:49:06,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:06,207 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-15 17:49:06,230 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-15 17:49:06,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:06,232 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-15 17:49:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:07,148 INFO L93 Difference]: Finished difference Result 364 states and 581 transitions. [2022-04-15 17:49:07,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:07,149 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-15 17:49:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:07,149 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-15 17:49:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-15 17:49:07,155 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-15 17:49:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 521 transitions. [2022-04-15 17:49:07,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 521 transitions. [2022-04-15 17:49:07,548 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-15 17:49:07,552 INFO L225 Difference]: With dead ends: 364 [2022-04-15 17:49:07,552 INFO L226 Difference]: Without dead ends: 200 [2022-04-15 17:49:07,553 INFO L912 BasicCegarLoop]: 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-15 17:49:07,554 INFO L913 BasicCegarLoop]: 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-15 17:49:07,555 INFO L914 BasicCegarLoop]: 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-15 17:49:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-15 17:49:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-15 17:49:07,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:07,579 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-15 17:49:07,580 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-15 17:49:07,581 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-15 17:49:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:07,591 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-15 17:49:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 17:49:07,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:07,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:07,592 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-15 17:49:07,593 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-15 17:49:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:07,602 INFO L93 Difference]: Finished difference Result 200 states and 313 transitions. [2022-04-15 17:49:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 17:49:07,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:07,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:07,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:07,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:07,603 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-15 17:49:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 313 transitions. [2022-04-15 17:49:07,614 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 313 transitions. Word has length 35 [2022-04-15 17:49:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:07,614 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 313 transitions. [2022-04-15 17:49:07,614 INFO L479 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-15 17:49:07,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 313 transitions. [2022-04-15 17:49:07,927 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-15 17:49:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 313 transitions. [2022-04-15 17:49:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 17:49:07,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:07,928 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:07,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:49:07,929 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 1 times [2022-04-15 17:49:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:07,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987702954] [2022-04-15 17:49:07,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1037347800, now seen corresponding path program 2 times [2022-04-15 17:49:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:07,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328115817] [2022-04-15 17:49:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:08,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:08,017 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-15 17:49:08,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-15 17:49:08,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-15 17:49:08,018 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-15 17:49:08,018 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-15 17:49:08,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {3183#true} assume true; {3183#true} is VALID [2022-04-15 17:49:08,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3183#true} {3183#true} #752#return; {3183#true} is VALID [2022-04-15 17:49:08,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {3183#true} call #t~ret59 := main(); {3183#true} is VALID [2022-04-15 17:49:08,019 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-15 17:49:08,020 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-15 17:49:08,022 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:08,023 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-15 17:49:08,027 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-15 17:49:08,028 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-15 17:49:08,028 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-15 17:49:08,029 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-15 17:49:08,029 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-15 17:49:08,029 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-15 17:49:08,030 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-15 17:49:08,030 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-15 17:49:08,031 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-15 17:49:08,031 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-15 17:49:08,031 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-15 17:49:08,032 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-15 17:49:08,032 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-15 17:49:08,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#false} ~s__state~0 := 3; {3184#false} is VALID [2022-04-15 17:49:08,033 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-15 17:49:08,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#false} assume 0 == ~s__s3__tmp__reuse_message~0; {3184#false} is VALID [2022-04-15 17:49:08,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {3184#false} assume 0 == ~skip~0; {3184#false} is VALID [2022-04-15 17:49:08,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {3184#false} assume 8560 == ~state~0; {3184#false} is VALID [2022-04-15 17:49:08,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {3184#false} assume 8448 == ~s__state~0; {3184#false} is VALID [2022-04-15 17:49:08,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#false} assume -1 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-15 17:49:08,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#false} assume -2 != ~s__verify_mode~0; {3184#false} is VALID [2022-04-15 17:49:08,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {3184#false} is VALID [2022-04-15 17:49:08,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {3184#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {3184#false} is VALID [2022-04-15 17:49:08,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {3184#false} assume 4 != ~blastFlag~0; {3184#false} is VALID [2022-04-15 17:49:08,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {3184#false} assume 1024 != ~tmp___7~0; {3184#false} is VALID [2022-04-15 17:49:08,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {3184#false} assume !false; {3184#false} is VALID [2022-04-15 17:49:08,035 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-15 17:49:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328115817] [2022-04-15 17:49:08,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328115817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:08,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:08,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:08,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987702954] [2022-04-15 17:49:08,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987702954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:08,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:08,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892663618] [2022-04-15 17:49:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:08,037 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-15 17:49:08,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:08,038 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-15 17:49:08,061 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-15 17:49:08,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:08,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:08,062 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-15 17:49:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:08,915 INFO L93 Difference]: Finished difference Result 393 states and 622 transitions. [2022-04-15 17:49:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:08,916 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-15 17:49:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:08,916 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-15 17:49:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:08,921 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-15 17:49:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:08,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 17:49:09,355 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-15 17:49:09,360 INFO L225 Difference]: With dead ends: 393 [2022-04-15 17:49:09,360 INFO L226 Difference]: Without dead ends: 207 [2022-04-15 17:49:09,361 INFO L912 BasicCegarLoop]: 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-15 17:49:09,364 INFO L913 BasicCegarLoop]: 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-15 17:49:09,364 INFO L914 BasicCegarLoop]: 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-15 17:49:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-15 17:49:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-04-15 17:49:09,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:09,392 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-15 17:49:09,393 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-15 17:49:09,393 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-15 17:49:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:09,411 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-15 17:49:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 17:49:09,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:09,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:09,413 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-15 17:49:09,413 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-15 17:49:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:09,418 INFO L93 Difference]: Finished difference Result 207 states and 326 transitions. [2022-04-15 17:49:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 17:49:09,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:09,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:09,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:09,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:09,421 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-15 17:49:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 326 transitions. [2022-04-15 17:49:09,426 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 326 transitions. Word has length 35 [2022-04-15 17:49:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:09,428 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 326 transitions. [2022-04-15 17:49:09,430 INFO L479 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-15 17:49:09,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 326 transitions. [2022-04-15 17:49:09,720 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-15 17:49:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 326 transitions. [2022-04-15 17:49:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 17:49:09,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:09,721 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:09,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:49:09,721 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 1 times [2022-04-15 17:49:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:09,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045406455] [2022-04-15 17:49:09,722 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1441132167, now seen corresponding path program 2 times [2022-04-15 17:49:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:09,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914156265] [2022-04-15 17:49:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:09,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:09,800 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-15 17:49:09,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-15 17:49:09,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-15 17:49:09,801 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-15 17:49:09,803 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-15 17:49:09,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {4814#true} assume true; {4814#true} is VALID [2022-04-15 17:49:09,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4814#true} {4814#true} #752#return; {4814#true} is VALID [2022-04-15 17:49:09,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {4814#true} call #t~ret59 := main(); {4814#true} is VALID [2022-04-15 17:49:09,812 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-15 17:49:09,813 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-15 17:49:09,816 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:09,816 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-15 17:49:09,817 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-15 17:49:09,817 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-15 17:49:09,818 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-15 17:49:09,818 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-15 17:49:09,818 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-15 17:49:09,819 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-15 17:49:09,819 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-15 17:49:09,819 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-15 17:49:09,820 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-15 17:49:09,820 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-15 17:49:09,820 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-15 17:49:09,821 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-15 17:49:09,821 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-15 17:49:09,821 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-15 17:49:09,821 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-15 17:49:09,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#false} assume 0 == ~s__s3__tmp__reuse_message~0; {4815#false} is VALID [2022-04-15 17:49:09,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#false} assume 0 == ~skip~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {4815#false} assume 8560 == ~state~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {4815#false} assume 8448 == ~s__state~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {4815#false} assume -1 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {4815#false} assume -2 != ~s__verify_mode~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {4815#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {4815#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {4815#false} assume 4 != ~blastFlag~0; {4815#false} is VALID [2022-04-15 17:49:09,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {4815#false} assume 1024 != ~tmp___7~0; {4815#false} is VALID [2022-04-15 17:49:09,823 INFO L290 TraceCheckUtils]: 34: Hoare triple {4815#false} assume !false; {4815#false} is VALID [2022-04-15 17:49:09,823 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-15 17:49:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:09,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914156265] [2022-04-15 17:49:09,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914156265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:09,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:09,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:09,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:09,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045406455] [2022-04-15 17:49:09,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045406455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:09,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:09,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106954601] [2022-04-15 17:49:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:09,825 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-15 17:49:09,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:09,826 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-15 17:49:09,847 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-15 17:49:09,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:09,849 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-15 17:49:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:10,644 INFO L93 Difference]: Finished difference Result 402 states and 636 transitions. [2022-04-15 17:49:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:10,644 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-15 17:49:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:10,645 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-15 17:49:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:10,650 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-15 17:49:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:10,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 17:49:10,990 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-15 17:49:10,993 INFO L225 Difference]: With dead ends: 402 [2022-04-15 17:49:10,993 INFO L226 Difference]: Without dead ends: 209 [2022-04-15 17:49:10,994 INFO L912 BasicCegarLoop]: 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-15 17:49:10,995 INFO L913 BasicCegarLoop]: 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-15 17:49:10,995 INFO L914 BasicCegarLoop]: 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-15 17:49:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-15 17:49:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-15 17:49:11,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:11,022 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-15 17:49:11,022 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-15 17:49:11,023 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-15 17:49:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:11,028 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-15 17:49:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-15 17:49:11,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:11,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:11,029 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-15 17:49:11,029 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-15 17:49:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:11,034 INFO L93 Difference]: Finished difference Result 209 states and 327 transitions. [2022-04-15 17:49:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 327 transitions. [2022-04-15 17:49:11,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:11,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:11,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:11,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:11,035 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-15 17:49:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 325 transitions. [2022-04-15 17:49:11,040 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 325 transitions. Word has length 35 [2022-04-15 17:49:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:11,040 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 325 transitions. [2022-04-15 17:49:11,040 INFO L479 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-15 17:49:11,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 325 transitions. [2022-04-15 17:49:11,346 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-15 17:49:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 325 transitions. [2022-04-15 17:49:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 17:49:11,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:11,347 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:11,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:49:11,348 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 1 times [2022-04-15 17:49:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853797112] [2022-04-15 17:49:11,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:11,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1028210496, now seen corresponding path program 2 times [2022-04-15 17:49:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:11,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743804536] [2022-04-15 17:49:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:11,416 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-15 17:49:11,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-15 17:49:11,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-15 17:49:11,417 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-15 17:49:11,417 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-15 17:49:11,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {6467#true} assume true; {6467#true} is VALID [2022-04-15 17:49:11,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6467#true} {6467#true} #752#return; {6467#true} is VALID [2022-04-15 17:49:11,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {6467#true} call #t~ret59 := main(); {6467#true} is VALID [2022-04-15 17:49:11,418 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-15 17:49:11,418 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-15 17:49:11,420 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:11,420 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-15 17:49:11,420 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-15 17:49:11,421 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-15 17:49:11,421 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-15 17:49:11,421 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-15 17:49:11,422 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-15 17:49:11,422 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-15 17:49:11,422 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-15 17:49:11,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {6468#false} ~s__server~0 := 1; {6468#false} is VALID [2022-04-15 17:49:11,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {6468#false} assume 0 != ~cb~0; {6468#false} is VALID [2022-04-15 17:49:11,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {6468#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {6468#false} is VALID [2022-04-15 17:49:11,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {6468#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {6468#false} is VALID [2022-04-15 17:49:11,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {6468#false} assume !(0 == ~s__init_buf___0~0); {6468#false} is VALID [2022-04-15 17:49:11,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {6468#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {6468#false} is VALID [2022-04-15 17:49:11,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {6468#false} assume 12292 != ~s__state~0; {6468#false} is VALID [2022-04-15 17:49:11,423 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-15 17:49:11,423 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-15 17:49:11,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {6468#false} assume 0 == ~s__s3__tmp__reuse_message~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {6468#false} assume 0 == ~skip~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {6468#false} assume 8560 == ~state~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {6468#false} assume 8448 == ~s__state~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {6468#false} assume -1 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {6468#false} assume -2 != ~s__verify_mode~0; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {6468#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {6468#false} is VALID [2022-04-15 17:49:11,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {6468#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {6468#false} is VALID [2022-04-15 17:49:11,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {6468#false} assume 4 != ~blastFlag~0; {6468#false} is VALID [2022-04-15 17:49:11,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {6468#false} assume 1024 != ~tmp___7~0; {6468#false} is VALID [2022-04-15 17:49:11,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {6468#false} assume !false; {6468#false} is VALID [2022-04-15 17:49:11,425 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-15 17:49:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:11,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743804536] [2022-04-15 17:49:11,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743804536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:11,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:11,426 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:11,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853797112] [2022-04-15 17:49:11,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853797112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:11,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:11,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632734121] [2022-04-15 17:49:11,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:11,427 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-15 17:49:11,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:11,427 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-15 17:49:11,449 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-15 17:49:11,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:11,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:11,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:11,450 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-15 17:49:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:12,248 INFO L93 Difference]: Finished difference Result 410 states and 644 transitions. [2022-04-15 17:49:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:12,248 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-15 17:49:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:12,249 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-15 17:49:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:12,252 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-15 17:49:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:49:12,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 17:49:12,605 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-15 17:49:12,610 INFO L225 Difference]: With dead ends: 410 [2022-04-15 17:49:12,610 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 17:49:12,610 INFO L912 BasicCegarLoop]: 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-15 17:49:12,613 INFO L913 BasicCegarLoop]: 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-15 17:49:12,617 INFO L914 BasicCegarLoop]: 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-15 17:49:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 17:49:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-15 17:49:12,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:12,644 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-15 17:49:12,645 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-15 17:49:12,646 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-15 17:49:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:12,650 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-15 17:49:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-15 17:49:12,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:12,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:12,651 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-15 17:49:12,652 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-15 17:49:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:12,656 INFO L93 Difference]: Finished difference Result 217 states and 335 transitions. [2022-04-15 17:49:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 335 transitions. [2022-04-15 17:49:12,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:12,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:12,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:12,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:12,658 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-15 17:49:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 323 transitions. [2022-04-15 17:49:12,662 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 323 transitions. Word has length 36 [2022-04-15 17:49:12,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:12,662 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 323 transitions. [2022-04-15 17:49:12,663 INFO L479 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-15 17:49:12,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 323 transitions. [2022-04-15 17:49:12,994 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-15 17:49:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 323 transitions. [2022-04-15 17:49:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 17:49:12,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:12,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:12,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:49:12,995 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 1 times [2022-04-15 17:49:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:12,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [516410831] [2022-04-15 17:49:12,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2097728708, now seen corresponding path program 2 times [2022-04-15 17:49:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:12,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406034000] [2022-04-15 17:49:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:13,112 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-15 17:49:13,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-15 17:49:13,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-15 17:49:13,113 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-15 17:49:13,113 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-15 17:49:13,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {8152#true} assume true; {8152#true} is VALID [2022-04-15 17:49:13,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8152#true} {8152#true} #752#return; {8152#true} is VALID [2022-04-15 17:49:13,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {8152#true} call #t~ret59 := main(); {8152#true} is VALID [2022-04-15 17:49:13,113 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-15 17:49:13,114 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-15 17:49:13,116 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:13,117 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-15 17:49:13,117 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-15 17:49:13,117 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-15 17:49:13,118 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-15 17:49:13,118 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-15 17:49:13,118 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-15 17:49:13,119 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-15 17:49:13,119 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-15 17:49:13,119 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-15 17:49:13,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {8153#false} ~s__server~0 := 1; {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {8153#false} assume 0 != ~cb~0; {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {8153#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {8153#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {8153#false} assume !(0 == ~s__init_buf___0~0); {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {8153#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {8153#false} is VALID [2022-04-15 17:49:13,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {8153#false} assume 12292 != ~s__state~0; {8153#false} is VALID [2022-04-15 17:49:13,120 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-15 17:49:13,120 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-15 17:49:13,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {8153#false} assume 0 == ~s__s3__tmp__reuse_message~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {8153#false} assume 0 == ~skip~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {8153#false} assume 8560 == ~state~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {8153#false} assume 8448 == ~s__state~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {8153#false} assume -1 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {8153#false} assume -2 != ~s__verify_mode~0; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {8153#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {8153#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {8153#false} is VALID [2022-04-15 17:49:13,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {8153#false} assume 4 != ~blastFlag~0; {8153#false} is VALID [2022-04-15 17:49:13,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {8153#false} assume 1024 != ~tmp___7~0; {8153#false} is VALID [2022-04-15 17:49:13,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {8153#false} assume !false; {8153#false} is VALID [2022-04-15 17:49:13,123 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-15 17:49:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406034000] [2022-04-15 17:49:13,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406034000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:13,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:13,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:13,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [516410831] [2022-04-15 17:49:13,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [516410831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:13,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:13,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123423128] [2022-04-15 17:49:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:13,124 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-15 17:49:13,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:13,126 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-15 17:49:13,150 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-15 17:49:13,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:13,151 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-15 17:49:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:13,984 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2022-04-15 17:49:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:13,985 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-15 17:49:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:13,985 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-15 17:49:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-15 17:49:13,988 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-15 17:49:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2022-04-15 17:49:13,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 523 transitions. [2022-04-15 17:49:14,420 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-15 17:49:14,424 INFO L225 Difference]: With dead ends: 410 [2022-04-15 17:49:14,424 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 17:49:14,425 INFO L912 BasicCegarLoop]: 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-15 17:49:14,425 INFO L913 BasicCegarLoop]: 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-15 17:49:14,426 INFO L914 BasicCegarLoop]: 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-15 17:49:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 17:49:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2022-04-15 17:49:14,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:14,445 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-15 17:49:14,445 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-15 17:49:14,446 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-15 17:49:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:14,450 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-15 17:49:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-15 17:49:14,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:14,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:14,451 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-15 17:49:14,452 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-15 17:49:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:14,456 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2022-04-15 17:49:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 333 transitions. [2022-04-15 17:49:14,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:14,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:14,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:14,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:14,457 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-15 17:49:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2022-04-15 17:49:14,461 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 37 [2022-04-15 17:49:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:14,462 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2022-04-15 17:49:14,462 INFO L479 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-15 17:49:14,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 321 transitions. [2022-04-15 17:49:14,836 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-15 17:49:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2022-04-15 17:49:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 17:49:14,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:14,837 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:14,837 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:49:14,837 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 1 times [2022-04-15 17:49:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:14,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1057204841] [2022-04-15 17:49:14,838 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:14,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1553278138, now seen corresponding path program 2 times [2022-04-15 17:49:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:14,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635928476] [2022-04-15 17:49:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:14,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-15 17:49:14,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-15 17:49:14,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-15 17:49:14,925 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-15 17:49:14,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-15 17:49:14,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {9837#true} assume true; {9837#true} is VALID [2022-04-15 17:49:14,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9837#true} {9837#true} #752#return; {9837#true} is VALID [2022-04-15 17:49:14,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {9837#true} call #t~ret59 := main(); {9837#true} is VALID [2022-04-15 17:49:14,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {9837#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {9837#true} is VALID [2022-04-15 17:49:14,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {9837#true} call #t~ret58 := ssl3_accept(~s~0); {9837#true} is VALID [2022-04-15 17:49:14,926 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:14,926 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-15 17:49:14,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-15 17:49:14,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {9837#true} assume !(0 != 12288 + ~tmp___1~0); {9837#true} is VALID [2022-04-15 17:49:14,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {9837#true} assume !(0 == ~s__cert~0); {9837#true} is VALID [2022-04-15 17:49:14,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {9837#true} assume !false; {9837#true} is VALID [2022-04-15 17:49:14,932 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-15 17:49:14,934 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-15 17:49:14,940 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-15 17:49:14,941 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-15 17:49:14,942 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-15 17:49:14,942 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-15 17:49:14,943 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-15 17:49:14,943 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-15 17:49:14,944 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-15 17:49:14,947 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-15 17:49:14,947 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-15 17:49:14,948 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-15 17:49:14,949 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-15 17:49:14,949 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-15 17:49:14,949 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-15 17:49:14,949 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-15 17:49:14,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {9843#(not (= 8560 ssl3_accept_~state~0))} assume 8560 == ~state~0; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {9838#false} assume 8448 == ~s__state~0; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {9838#false} assume -1 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {9838#false} assume -2 != ~s__verify_mode~0; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {9838#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {9838#false} assume 4 != ~blastFlag~0; {9838#false} is VALID [2022-04-15 17:49:14,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {9838#false} assume 1024 != ~tmp___7~0; {9838#false} is VALID [2022-04-15 17:49:14,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {9838#false} assume !false; {9838#false} is VALID [2022-04-15 17:49:14,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-15 17:49:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635928476] [2022-04-15 17:49:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635928476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:14,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:14,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1057204841] [2022-04-15 17:49:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1057204841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:14,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864545119] [2022-04-15 17:49:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:14,952 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-15 17:49:14,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:14,953 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-15 17:49:14,977 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-15 17:49:14,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:49:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:14,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:49:14,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:49:14,978 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-15 17:49:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:15,774 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2022-04-15 17:49:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:49:15,774 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-15 17:49:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:15,774 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-15 17:49:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 17:49:15,778 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-15 17:49:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-15 17:49:15,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-15 17:49:16,196 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-15 17:49:16,201 INFO L225 Difference]: With dead ends: 443 [2022-04-15 17:49:16,201 INFO L226 Difference]: Without dead ends: 250 [2022-04-15 17:49:16,202 INFO L912 BasicCegarLoop]: 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-15 17:49:16,202 INFO L913 BasicCegarLoop]: 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-15 17:49:16,203 INFO L914 BasicCegarLoop]: 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-15 17:49:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-15 17:49:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 214. [2022-04-15 17:49:16,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:16,226 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-15 17:49:16,228 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-15 17:49:16,228 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-15 17:49:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:16,234 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-15 17:49:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-15 17:49:16,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:16,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:16,235 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-15 17:49:16,236 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-15 17:49:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:16,241 INFO L93 Difference]: Finished difference Result 250 states and 383 transitions. [2022-04-15 17:49:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 383 transitions. [2022-04-15 17:49:16,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:16,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:16,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:16,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:16,243 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-15 17:49:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2022-04-15 17:49:16,248 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 38 [2022-04-15 17:49:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:16,248 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2022-04-15 17:49:16,248 INFO L479 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-15 17:49:16,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 331 transitions. [2022-04-15 17:49:16,662 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-15 17:49:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2022-04-15 17:49:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 17:49:16,663 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:16,663 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:16,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:49:16,663 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:16,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 1 times [2022-04-15 17:49:16,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:16,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102206931] [2022-04-15 17:49:16,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash 839158341, now seen corresponding path program 2 times [2022-04-15 17:49:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:16,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042254659] [2022-04-15 17:49:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:16,751 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-15 17:49:16,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 17:49:16,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-15 17:49:16,752 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-15 17:49:16,753 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-15 17:49:16,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 17:49:16,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #752#return; {11667#true} is VALID [2022-04-15 17:49:16,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret59 := main(); {11667#true} is VALID [2022-04-15 17:49:16,753 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-15 17:49:16,754 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-15 17:49:16,755 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:16,756 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-15 17:49:16,756 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-15 17:49:16,756 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-15 17:49:16,757 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-15 17:49:16,757 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-15 17:49:16,757 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-15 17:49:16,757 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-15 17:49:16,758 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-15 17:49:16,758 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-15 17:49:16,758 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-15 17:49:16,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {11668#false} ~s__server~0 := 1; {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {11668#false} assume 0 != ~cb~0; {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {11668#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {11668#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {11668#false} assume !(0 == ~s__init_buf___0~0); {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {11668#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {11668#false} is VALID [2022-04-15 17:49:16,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {11668#false} assume 12292 != ~s__state~0; {11668#false} is VALID [2022-04-15 17:49:16,760 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-15 17:49:16,760 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-15 17:49:16,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {11668#false} assume 0 == ~s__s3__tmp__reuse_message~0; {11668#false} is VALID [2022-04-15 17:49:16,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {11668#false} assume 0 == ~skip~0; {11668#false} is VALID [2022-04-15 17:49:16,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {11668#false} assume 8560 == ~state~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} assume 8448 == ~s__state~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume -1 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume -2 != ~s__verify_mode~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {11668#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {11668#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {11668#false} assume 4 != ~blastFlag~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {11668#false} assume 1024 != ~tmp___7~0; {11668#false} is VALID [2022-04-15 17:49:16,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-15 17:49:16,763 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-15 17:49:16,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:16,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042254659] [2022-04-15 17:49:16,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042254659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:16,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:16,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:16,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:16,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102206931] [2022-04-15 17:49:16,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102206931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:16,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:16,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175131834] [2022-04-15 17:49:16,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:16,765 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-15 17:49:16,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:16,765 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-15 17:49:16,789 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-15 17:49:16,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:16,791 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-15 17:49:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:17,575 INFO L93 Difference]: Finished difference Result 424 states and 656 transitions. [2022-04-15 17:49:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:17,576 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-15 17:49:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:17,576 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-15 17:49:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 17:49:17,580 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-15 17:49:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 17:49:17,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-15 17:49:18,004 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-15 17:49:18,009 INFO L225 Difference]: With dead ends: 424 [2022-04-15 17:49:18,009 INFO L226 Difference]: Without dead ends: 224 [2022-04-15 17:49:18,009 INFO L912 BasicCegarLoop]: 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-15 17:49:18,012 INFO L913 BasicCegarLoop]: 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-15 17:49:18,012 INFO L914 BasicCegarLoop]: 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-15 17:49:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-15 17:49:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-15 17:49:18,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:18,044 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-15 17:49:18,045 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-15 17:49:18,046 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-15 17:49:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:18,051 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-15 17:49:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-15 17:49:18,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:18,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:18,053 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-15 17:49:18,053 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-15 17:49:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:18,058 INFO L93 Difference]: Finished difference Result 224 states and 341 transitions. [2022-04-15 17:49:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 341 transitions. [2022-04-15 17:49:18,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:18,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:18,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:18,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:18,060 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-15 17:49:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2022-04-15 17:49:18,066 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 38 [2022-04-15 17:49:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:18,066 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2022-04-15 17:49:18,066 INFO L479 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-15 17:49:18,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 329 transitions. [2022-04-15 17:49:18,456 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-15 17:49:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2022-04-15 17:49:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 17:49:18,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:18,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:18,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:49:18,457 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:18,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 1 times [2022-04-15 17:49:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:18,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544875826] [2022-04-15 17:49:18,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:18,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1549869087, now seen corresponding path program 2 times [2022-04-15 17:49:18,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:18,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399773159] [2022-04-15 17:49:18,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:18,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:18,524 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-15 17:49:18,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-15 17:49:18,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-15 17:49:18,525 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-15 17:49:18,525 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-15 17:49:18,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {13408#true} assume true; {13408#true} is VALID [2022-04-15 17:49:18,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13408#true} {13408#true} #752#return; {13408#true} is VALID [2022-04-15 17:49:18,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {13408#true} call #t~ret59 := main(); {13408#true} is VALID [2022-04-15 17:49:18,526 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-15 17:49:18,526 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-15 17:49:18,528 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:18,528 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-15 17:49:18,529 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-15 17:49:18,529 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-15 17:49:18,529 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-15 17:49:18,529 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-15 17:49:18,530 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-15 17:49:18,530 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-15 17:49:18,530 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-15 17:49:18,531 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-15 17:49:18,531 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-15 17:49:18,531 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-15 17:49:18,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {13409#false} ~s__server~0 := 1; {13409#false} is VALID [2022-04-15 17:49:18,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {13409#false} assume 0 != ~cb~0; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {13409#false} ~__cil_tmp55~0 := 8 * ~s__version~0; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {13409#false} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {13409#false} assume !(0 == ~s__init_buf___0~0); {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {13409#false} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {13409#false} assume 12292 != ~s__state~0; {13409#false} is VALID [2022-04-15 17:49:18,532 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-15 17:49:18,532 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-15 17:49:18,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {13409#false} assume 0 == ~s__s3__tmp__reuse_message~0; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {13409#false} assume 0 == ~skip~0; {13409#false} is VALID [2022-04-15 17:49:18,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {13409#false} assume 8560 == ~state~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {13409#false} assume 8448 == ~s__state~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {13409#false} assume -1 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {13409#false} assume -2 != ~s__verify_mode~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {13409#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {13409#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {13409#false} assume 4 != ~blastFlag~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {13409#false} assume 1024 != ~tmp___7~0; {13409#false} is VALID [2022-04-15 17:49:18,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {13409#false} assume !false; {13409#false} is VALID [2022-04-15 17:49:18,533 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-15 17:49:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:18,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399773159] [2022-04-15 17:49:18,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399773159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:18,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:18,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:18,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:18,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544875826] [2022-04-15 17:49:18,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544875826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:18,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:18,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048622831] [2022-04-15 17:49:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:18,535 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-15 17:49:18,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:18,536 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-15 17:49:18,560 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-15 17:49:18,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:18,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:18,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:18,560 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-15 17:49:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:19,388 INFO L93 Difference]: Finished difference Result 424 states and 652 transitions. [2022-04-15 17:49:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:19,388 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-15 17:49:19,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:19,388 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-15 17:49:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 17:49:19,392 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-15 17:49:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 17:49:19,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-15 17:49:19,814 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-15 17:49:19,818 INFO L225 Difference]: With dead ends: 424 [2022-04-15 17:49:19,818 INFO L226 Difference]: Without dead ends: 224 [2022-04-15 17:49:19,819 INFO L912 BasicCegarLoop]: 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-15 17:49:19,819 INFO L913 BasicCegarLoop]: 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-15 17:49:19,820 INFO L914 BasicCegarLoop]: 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-15 17:49:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-04-15 17:49:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-04-15 17:49:19,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:19,847 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-15 17:49:19,849 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-15 17:49:19,849 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-15 17:49:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:19,854 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-15 17:49:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-15 17:49:19,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:19,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:19,855 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-15 17:49:19,856 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-15 17:49:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:19,861 INFO L93 Difference]: Finished difference Result 224 states and 339 transitions. [2022-04-15 17:49:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 339 transitions. [2022-04-15 17:49:19,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:19,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:19,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:19,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:19,863 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-15 17:49:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 327 transitions. [2022-04-15 17:49:19,868 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 327 transitions. Word has length 39 [2022-04-15 17:49:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:19,869 INFO L478 AbstractCegarLoop]: Abstraction has 214 states and 327 transitions. [2022-04-15 17:49:19,869 INFO L479 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-15 17:49:19,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 214 states and 327 transitions. [2022-04-15 17:49:20,268 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-15 17:49:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 327 transitions. [2022-04-15 17:49:20,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 17:49:20,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:20,268 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:20,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:49:20,269 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 1 times [2022-04-15 17:49:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:20,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656640410] [2022-04-15 17:49:20,269 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1904631677, now seen corresponding path program 2 times [2022-04-15 17:49:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326934890] [2022-04-15 17:49:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:20,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:20,345 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-15 17:49:20,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-15 17:49:20,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-15 17:49:20,346 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-15 17:49:20,346 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-15 17:49:20,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {15149#true} assume true; {15149#true} is VALID [2022-04-15 17:49:20,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15149#true} {15149#true} #752#return; {15149#true} is VALID [2022-04-15 17:49:20,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {15149#true} call #t~ret59 := main(); {15149#true} is VALID [2022-04-15 17:49:20,347 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-15 17:49:20,347 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-15 17:49:20,349 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:20,349 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-15 17:49:20,350 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-15 17:49:20,350 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-15 17:49:20,350 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-15 17:49:20,351 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-15 17:49:20,351 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-15 17:49:20,351 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-15 17:49:20,351 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-15 17:49:20,352 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-15 17:49:20,352 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-15 17:49:20,352 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-15 17:49:20,353 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-15 17:49:20,353 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-15 17:49:20,353 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-15 17:49:20,354 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-15 17:49:20,354 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-15 17:49:20,354 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-15 17:49:20,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {15150#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15150#false} is VALID [2022-04-15 17:49:20,354 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-15 17:49:20,354 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-15 17:49:20,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {15150#false} assume 0 == ~s__s3__tmp__reuse_message~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {15150#false} assume 0 == ~skip~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {15150#false} assume 8560 == ~state~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {15150#false} assume 8448 == ~s__state~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {15150#false} assume -1 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {15150#false} assume -2 != ~s__verify_mode~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {15150#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 35: Hoare triple {15150#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 36: Hoare triple {15150#false} assume 4 != ~blastFlag~0; {15150#false} is VALID [2022-04-15 17:49:20,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {15150#false} assume 1024 != ~tmp___7~0; {15150#false} is VALID [2022-04-15 17:49:20,356 INFO L290 TraceCheckUtils]: 38: Hoare triple {15150#false} assume !false; {15150#false} is VALID [2022-04-15 17:49:20,356 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-15 17:49:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326934890] [2022-04-15 17:49:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326934890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:20,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:20,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:20,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656640410] [2022-04-15 17:49:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656640410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599064082] [2022-04-15 17:49:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:20,357 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-15 17:49:20,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:20,358 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-15 17:49:20,385 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-15 17:49:20,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:20,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:20,386 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-15 17:49:21,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:21,142 INFO L93 Difference]: Finished difference Result 419 states and 644 transitions. [2022-04-15 17:49:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:21,143 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-15 17:49:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:21,143 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-15 17:49:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 17:49:21,157 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-15 17:49:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2022-04-15 17:49:21,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 524 transitions. [2022-04-15 17:49:21,571 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-15 17:49:21,575 INFO L225 Difference]: With dead ends: 419 [2022-04-15 17:49:21,576 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 17:49:21,576 INFO L912 BasicCegarLoop]: 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-15 17:49:21,577 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 754 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:21,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 204 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:21,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 17:49:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2022-04-15 17:49:21,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:21,604 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-15 17:49:21,605 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-15 17:49:21,606 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-15 17:49:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:21,611 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-15 17:49:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-15 17:49:21,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:21,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:21,613 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-15 17:49:21,614 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-15 17:49:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:21,619 INFO L93 Difference]: Finished difference Result 219 states and 334 transitions. [2022-04-15 17:49:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2022-04-15 17:49:21,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:21,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:21,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:21,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:21,620 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-15 17:49:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 330 transitions. [2022-04-15 17:49:21,626 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 330 transitions. Word has length 39 [2022-04-15 17:49:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:21,626 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 330 transitions. [2022-04-15 17:49:21,626 INFO L479 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-15 17:49:21,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 330 transitions. [2022-04-15 17:49:22,094 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-15 17:49:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 330 transitions. [2022-04-15 17:49:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 17:49:22,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:22,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:22,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:49:22,095 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 1 times [2022-04-15 17:49:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869271584] [2022-04-15 17:49:22,096 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash -827017343, now seen corresponding path program 2 times [2022-04-15 17:49:22,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955265865] [2022-04-15 17:49:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:22,160 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-15 17:49:22,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-15 17:49:22,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-15 17:49:22,161 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-15 17:49:22,161 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-15 17:49:22,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {16874#true} assume true; {16874#true} is VALID [2022-04-15 17:49:22,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16874#true} {16874#true} #752#return; {16874#true} is VALID [2022-04-15 17:49:22,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {16874#true} call #t~ret59 := main(); {16874#true} is VALID [2022-04-15 17:49:22,161 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-15 17:49:22,162 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-15 17:49:22,164 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:22,164 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-15 17:49:22,164 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-15 17:49:22,164 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-15 17:49:22,165 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-15 17:49:22,165 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-15 17:49:22,165 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-15 17:49:22,166 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-15 17:49:22,166 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-15 17:49:22,166 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-15 17:49:22,167 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-15 17:49:22,167 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-15 17:49:22,167 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-15 17:49:22,168 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-15 17:49:22,168 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-15 17:49:22,168 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-15 17:49:22,169 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-15 17:49:22,169 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-15 17:49:22,169 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-15 17:49:22,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {16875#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16875#false} is VALID [2022-04-15 17:49:22,169 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-15 17:49:22,169 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-15 17:49:22,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {16875#false} assume 0 == ~s__s3__tmp__reuse_message~0; {16875#false} is VALID [2022-04-15 17:49:22,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {16875#false} assume 0 == ~skip~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {16875#false} assume 8560 == ~state~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {16875#false} assume 8448 == ~s__state~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {16875#false} assume -1 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {16875#false} assume -2 != ~s__verify_mode~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {16875#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {16875#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {16875#false} assume 4 != ~blastFlag~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {16875#false} assume 1024 != ~tmp___7~0; {16875#false} is VALID [2022-04-15 17:49:22,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {16875#false} assume !false; {16875#false} is VALID [2022-04-15 17:49:22,171 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-15 17:49:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955265865] [2022-04-15 17:49:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955265865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:22,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:22,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869271584] [2022-04-15 17:49:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869271584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:22,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:22,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335161506] [2022-04-15 17:49:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:22,172 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-15 17:49:22,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:22,172 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-15 17:49:22,203 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-15 17:49:22,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:22,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:22,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:22,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:22,204 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-15 17:49:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:22,979 INFO L93 Difference]: Finished difference Result 444 states and 678 transitions. [2022-04-15 17:49:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:22,979 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-15 17:49:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:22,980 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-15 17:49:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 17:49:22,984 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-15 17:49:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2022-04-15 17:49:22,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 525 transitions. [2022-04-15 17:49:23,332 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-15 17:49:23,337 INFO L225 Difference]: With dead ends: 444 [2022-04-15 17:49:23,337 INFO L226 Difference]: Without dead ends: 242 [2022-04-15 17:49:23,338 INFO L912 BasicCegarLoop]: 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-15 17:49:23,338 INFO L913 BasicCegarLoop]: 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-15 17:49:23,338 INFO L914 BasicCegarLoop]: 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-15 17:49:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-15 17:49:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2022-04-15 17:49:23,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:23,380 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-15 17:49:23,381 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-15 17:49:23,382 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-15 17:49:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:23,388 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-15 17:49:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-15 17:49:23,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:23,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:23,390 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-15 17:49:23,391 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-15 17:49:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:23,396 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2022-04-15 17:49:23,396 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 365 transitions. [2022-04-15 17:49:23,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:23,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:23,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:23,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:23,398 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-15 17:49:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 361 transitions. [2022-04-15 17:49:23,403 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 361 transitions. Word has length 40 [2022-04-15 17:49:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:23,403 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 361 transitions. [2022-04-15 17:49:23,403 INFO L479 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-15 17:49:23,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 361 transitions. [2022-04-15 17:49:23,917 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-15 17:49:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 361 transitions. [2022-04-15 17:49:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 17:49:23,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:23,918 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:23,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:49:23,918 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 1 times [2022-04-15 17:49:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:23,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1563855296] [2022-04-15 17:49:23,919 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:23,919 INFO L85 PathProgramCache]: Analyzing trace with hash 341017417, now seen corresponding path program 2 times [2022-04-15 17:49:23,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:23,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924785154] [2022-04-15 17:49:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:23,993 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-15 17:49:23,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-15 17:49:23,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-15 17:49:23,994 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-15 17:49:23,994 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-15 17:49:23,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {18741#true} assume true; {18741#true} is VALID [2022-04-15 17:49:23,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18741#true} {18741#true} #752#return; {18741#true} is VALID [2022-04-15 17:49:23,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {18741#true} call #t~ret59 := main(); {18741#true} is VALID [2022-04-15 17:49:23,994 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-15 17:49:23,995 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-15 17:49:23,996 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:23,997 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-15 17:49:23,997 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-15 17:49:23,997 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-15 17:49:23,998 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-15 17:49:23,998 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-15 17:49:23,998 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-15 17:49:23,998 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-15 17:49:23,999 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-15 17:49:23,999 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-15 17:49:23,999 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-15 17:49:24,000 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-15 17:49:24,000 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-15 17:49:24,000 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-15 17:49:24,001 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-15 17:49:24,001 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-15 17:49:24,001 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-15 17:49:24,001 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-15 17:49:24,002 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-15 17:49:24,002 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-15 17:49:24,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {18742#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {18742#false} is VALID [2022-04-15 17:49:24,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {18742#false} assume !(~ret~0 <= 0); {18742#false} is VALID [2022-04-15 17:49:24,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {18742#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {18742#false} is VALID [2022-04-15 17:49:24,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {18742#false} ~s__init_num~0 := 0; {18742#false} is VALID [2022-04-15 17:49:24,002 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-15 17:49:24,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {18742#false} assume 0 == ~s__s3__tmp__reuse_message~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {18742#false} assume 0 == ~skip~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {18742#false} assume 8560 == ~state~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {18742#false} assume 8448 == ~s__state~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 36: Hoare triple {18742#false} assume -1 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 37: Hoare triple {18742#false} assume -2 != ~s__verify_mode~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 38: Hoare triple {18742#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {18742#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {18742#false} assume 4 != ~blastFlag~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {18742#false} assume 1024 != ~tmp___7~0; {18742#false} is VALID [2022-04-15 17:49:24,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {18742#false} assume !false; {18742#false} is VALID [2022-04-15 17:49:24,004 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-15 17:49:24,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:24,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924785154] [2022-04-15 17:49:24,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924785154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:24,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:24,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:24,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1563855296] [2022-04-15 17:49:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1563855296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:24,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:24,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271465734] [2022-04-15 17:49:24,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:24,005 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-15 17:49:24,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:24,006 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-15 17:49:24,033 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-15 17:49:24,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:24,034 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-15 17:49:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:24,830 INFO L93 Difference]: Finished difference Result 493 states and 745 transitions. [2022-04-15 17:49:24,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:24,830 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-15 17:49:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:24,830 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-15 17:49:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-15 17:49:24,833 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-15 17:49:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2022-04-15 17:49:24,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 529 transitions. [2022-04-15 17:49:25,261 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-15 17:49:25,267 INFO L225 Difference]: With dead ends: 493 [2022-04-15 17:49:25,268 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 17:49:25,268 INFO L912 BasicCegarLoop]: 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-15 17:49:25,269 INFO L913 BasicCegarLoop]: 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-15 17:49:25,269 INFO L914 BasicCegarLoop]: 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-15 17:49:25,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 17:49:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-04-15 17:49:25,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:25,306 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-15 17:49:25,307 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-15 17:49:25,307 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-15 17:49:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:25,313 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-15 17:49:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-15 17:49:25,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:25,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:25,314 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-15 17:49:25,314 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-15 17:49:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:25,320 INFO L93 Difference]: Finished difference Result 268 states and 401 transitions. [2022-04-15 17:49:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 401 transitions. [2022-04-15 17:49:25,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:25,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:25,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:25,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:25,321 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-15 17:49:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 395 transitions. [2022-04-15 17:49:25,327 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 395 transitions. Word has length 43 [2022-04-15 17:49:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:25,328 INFO L478 AbstractCegarLoop]: Abstraction has 264 states and 395 transitions. [2022-04-15 17:49:25,328 INFO L479 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-15 17:49:25,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 395 transitions. [2022-04-15 17:49:25,894 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-15 17:49:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2022-04-15 17:49:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 17:49:25,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:25,895 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:25,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:49:25,896 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:25,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 1 times [2022-04-15 17:49:25,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:25,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [368488917] [2022-04-15 17:49:25,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1564538053, now seen corresponding path program 2 times [2022-04-15 17:49:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:25,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444931042] [2022-04-15 17:49:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:25,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:25,962 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-15 17:49:25,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-15 17:49:25,962 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-15 17:49:25,963 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-15 17:49:25,963 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-15 17:49:25,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {20808#true} assume true; {20808#true} is VALID [2022-04-15 17:49:25,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20808#true} {20808#true} #752#return; {20808#true} is VALID [2022-04-15 17:49:25,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {20808#true} call #t~ret59 := main(); {20808#true} is VALID [2022-04-15 17:49:25,963 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-15 17:49:25,964 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-15 17:49:25,965 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:25,966 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-15 17:49:25,966 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-15 17:49:25,966 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-15 17:49:25,966 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-15 17:49:25,967 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-15 17:49:25,967 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-15 17:49:25,967 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-15 17:49:25,968 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-15 17:49:25,968 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-15 17:49:25,968 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-15 17:49:25,968 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-15 17:49:25,969 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-15 17:49:25,969 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-15 17:49:25,969 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-15 17:49:25,970 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-15 17:49:25,970 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-15 17:49:25,970 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-15 17:49:25,971 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-15 17:49:25,971 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-15 17:49:25,971 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-15 17:49:25,971 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-15 17:49:25,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {20809#false} assume 0 != (256 + ~__cil_tmp56~0) % 18446744073709551616;~__cil_tmp56~0 := 256345;~skip~0 := 1; {20809#false} is VALID [2022-04-15 17:49:25,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {20809#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {20809#false} is VALID [2022-04-15 17:49:25,971 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-15 17:49:25,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {20809#false} assume 0 == ~s__s3__tmp__reuse_message~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {20809#false} assume 0 == ~skip~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {20809#false} assume 8560 == ~state~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {20809#false} assume 8448 == ~s__state~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {20809#false} assume -1 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {20809#false} assume -2 != ~s__verify_mode~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {20809#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {20809#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {20809#false} assume 4 != ~blastFlag~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {20809#false} assume 1024 != ~tmp___7~0; {20809#false} is VALID [2022-04-15 17:49:25,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {20809#false} assume !false; {20809#false} is VALID [2022-04-15 17:49:25,973 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-15 17:49:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:25,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444931042] [2022-04-15 17:49:25,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444931042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:25,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:25,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:25,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:25,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [368488917] [2022-04-15 17:49:25,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [368488917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:25,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:25,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:25,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015495299] [2022-04-15 17:49:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:25,974 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-15 17:49:25,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:25,975 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-15 17:49:26,002 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-15 17:49:26,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:26,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:26,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:26,003 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-15 17:49:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:26,770 INFO L93 Difference]: Finished difference Result 547 states and 818 transitions. [2022-04-15 17:49:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:26,770 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-15 17:49:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:26,771 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-15 17:49:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 17:49:26,774 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-15 17:49:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 17:49:26,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-15 17:49:27,210 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-15 17:49:27,216 INFO L225 Difference]: With dead ends: 547 [2022-04-15 17:49:27,217 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 17:49:27,217 INFO L912 BasicCegarLoop]: 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-15 17:49:27,218 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 768 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:27,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 206 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 17:49:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2022-04-15 17:49:27,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:27,262 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-15 17:49:27,263 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-15 17:49:27,263 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-15 17:49:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:27,269 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-15 17:49:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-15 17:49:27,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:27,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:27,271 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-15 17:49:27,271 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-15 17:49:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:27,277 INFO L93 Difference]: Finished difference Result 297 states and 440 transitions. [2022-04-15 17:49:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 440 transitions. [2022-04-15 17:49:27,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:27,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:27,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:27,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:27,279 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-15 17:49:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 433 transitions. [2022-04-15 17:49:27,287 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 433 transitions. Word has length 43 [2022-04-15 17:49:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:27,287 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 433 transitions. [2022-04-15 17:49:27,287 INFO L479 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-15 17:49:27,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 292 states and 433 transitions. [2022-04-15 17:49:27,874 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-15 17:49:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 433 transitions. [2022-04-15 17:49:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 17:49:27,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:27,875 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:27,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 17:49:27,875 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:27,875 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 1 times [2022-04-15 17:49:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701189271] [2022-04-15 17:49:27,876 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -570717011, now seen corresponding path program 2 times [2022-04-15 17:49:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932390267] [2022-04-15 17:49:27,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:27,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:27,944 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-15 17:49:27,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-15 17:49:27,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-15 17:49:27,945 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-15 17:49:27,945 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-15 17:49:27,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {23097#true} assume true; {23097#true} is VALID [2022-04-15 17:49:27,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23097#true} {23097#true} #752#return; {23097#true} is VALID [2022-04-15 17:49:27,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {23097#true} call #t~ret59 := main(); {23097#true} is VALID [2022-04-15 17:49:27,946 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-15 17:49:27,946 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-15 17:49:27,948 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:27,948 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-15 17:49:27,948 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-15 17:49:27,949 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-15 17:49:27,949 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-15 17:49:27,949 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-15 17:49:27,950 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-15 17:49:27,950 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-15 17:49:27,950 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-15 17:49:27,950 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-15 17:49:27,951 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-15 17:49:27,951 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-15 17:49:27,951 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-15 17:49:27,952 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-15 17:49:27,952 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-15 17:49:27,952 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-15 17:49:27,952 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-15 17:49:27,953 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-15 17:49:27,953 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-15 17:49:27,953 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-15 17:49:27,953 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-15 17:49:27,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {23098#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {23098#false} assume !(~ret~0 <= 0); {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {23098#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {23098#false} ~s__init_num~0 := 0; {23098#false} is VALID [2022-04-15 17:49:27,954 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-15 17:49:27,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {23098#false} assume 0 == ~s__s3__tmp__reuse_message~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {23098#false} assume 0 == ~skip~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {23098#false} assume 8560 == ~state~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {23098#false} assume 8448 == ~s__state~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {23098#false} assume -1 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {23098#false} assume -2 != ~s__verify_mode~0; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 39: Hoare triple {23098#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {23098#false} is VALID [2022-04-15 17:49:27,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {23098#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {23098#false} is VALID [2022-04-15 17:49:27,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {23098#false} assume 4 != ~blastFlag~0; {23098#false} is VALID [2022-04-15 17:49:27,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {23098#false} assume 1024 != ~tmp___7~0; {23098#false} is VALID [2022-04-15 17:49:27,955 INFO L290 TraceCheckUtils]: 43: Hoare triple {23098#false} assume !false; {23098#false} is VALID [2022-04-15 17:49:27,955 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-15 17:49:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:27,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932390267] [2022-04-15 17:49:27,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932390267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:27,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:27,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:27,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:27,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701189271] [2022-04-15 17:49:27,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701189271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:27,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:27,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652488044] [2022-04-15 17:49:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:27,957 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-15 17:49:27,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:27,957 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-15 17:49:27,984 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-15 17:49:27,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:27,985 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-15 17:49:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:28,764 INFO L93 Difference]: Finished difference Result 575 states and 856 transitions. [2022-04-15 17:49:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:28,764 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-15 17:49:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:28,765 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-15 17:49:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-15 17:49:28,768 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-15 17:49:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2022-04-15 17:49:28,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 531 transitions. [2022-04-15 17:49:29,229 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-15 17:49:29,235 INFO L225 Difference]: With dead ends: 575 [2022-04-15 17:49:29,235 INFO L226 Difference]: Without dead ends: 297 [2022-04-15 17:49:29,236 INFO L912 BasicCegarLoop]: 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-15 17:49:29,237 INFO L913 BasicCegarLoop]: 189 mSDtfsCounter, 761 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:29,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 206 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:49:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-15 17:49:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-15 17:49:29,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:29,283 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-15 17:49:29,284 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-15 17:49:29,285 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-15 17:49:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:29,290 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-15 17:49:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-15 17:49:29,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:29,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:29,292 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-15 17:49:29,292 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-15 17:49:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:29,299 INFO L93 Difference]: Finished difference Result 297 states and 439 transitions. [2022-04-15 17:49:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 439 transitions. [2022-04-15 17:49:29,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:29,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:29,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:29,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:29,301 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-15 17:49:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 433 transitions. [2022-04-15 17:49:29,308 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 433 transitions. Word has length 44 [2022-04-15 17:49:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:29,308 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 433 transitions. [2022-04-15 17:49:29,308 INFO L479 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-15 17:49:29,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 433 transitions. [2022-04-15 17:49:29,909 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-15 17:49:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 433 transitions. [2022-04-15 17:49:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 17:49:29,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:29,910 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:29,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 17:49:29,910 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 1 times [2022-04-15 17:49:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845240333] [2022-04-15 17:49:29,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1737605119, now seen corresponding path program 2 times [2022-04-15 17:49:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393480477] [2022-04-15 17:49:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:30,011 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-15 17:49:30,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-15 17:49:30,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-15 17:49:30,012 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-15 17:49:30,012 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-15 17:49:30,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {25444#true} assume true; {25444#true} is VALID [2022-04-15 17:49:30,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25444#true} {25444#true} #752#return; {25444#true} is VALID [2022-04-15 17:49:30,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {25444#true} call #t~ret59 := main(); {25444#true} is VALID [2022-04-15 17:49:30,013 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-15 17:49:30,013 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-15 17:49:30,015 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:30,015 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-15 17:49:30,015 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-15 17:49:30,016 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-15 17:49:30,016 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-15 17:49:30,016 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-15 17:49:30,017 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-15 17:49:30,017 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-15 17:49:30,017 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-15 17:49:30,018 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-15 17:49:30,018 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-15 17:49:30,018 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-15 17:49:30,018 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-15 17:49:30,019 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-15 17:49:30,019 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-15 17:49:30,019 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-15 17:49:30,020 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-15 17:49:30,020 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-15 17:49:30,020 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-15 17:49:30,021 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-15 17:49:30,021 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-15 17:49:30,022 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-15 17:49:30,022 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-15 17:49:30,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {25445#false} assume 0 != (256 + ~__cil_tmp56~0) % 18446744073709551616;~__cil_tmp56~0 := 256345;~skip~0 := 1; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {25445#false} ~s__state~0 := 8528;~s__init_num~0 := 0; {25445#false} is VALID [2022-04-15 17:49:30,022 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-15 17:49:30,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {25445#false} assume 0 == ~s__s3__tmp__reuse_message~0; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {25445#false} assume 0 == ~skip~0; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {25445#false} assume 8560 == ~state~0; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {25445#false} assume 8448 == ~s__state~0; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {25445#false} assume -1 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-15 17:49:30,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {25445#false} assume -2 != ~s__verify_mode~0; {25445#false} is VALID [2022-04-15 17:49:30,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {25445#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {25445#false} is VALID [2022-04-15 17:49:30,023 INFO L290 TraceCheckUtils]: 40: Hoare triple {25445#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {25445#false} is VALID [2022-04-15 17:49:30,023 INFO L290 TraceCheckUtils]: 41: Hoare triple {25445#false} assume 4 != ~blastFlag~0; {25445#false} is VALID [2022-04-15 17:49:30,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {25445#false} assume 1024 != ~tmp___7~0; {25445#false} is VALID [2022-04-15 17:49:30,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {25445#false} assume !false; {25445#false} is VALID [2022-04-15 17:49:30,023 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-15 17:49:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393480477] [2022-04-15 17:49:30,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393480477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:30,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:30,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:30,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:30,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845240333] [2022-04-15 17:49:30,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845240333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:30,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:30,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29345052] [2022-04-15 17:49:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:30,025 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-15 17:49:30,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:30,025 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-15 17:49:30,053 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-15 17:49:30,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:30,054 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-15 17:49:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:30,827 INFO L93 Difference]: Finished difference Result 579 states and 859 transitions. [2022-04-15 17:49:30,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:30,827 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-15 17:49:30,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:30,828 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-15 17:49:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 17:49:30,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-15 17:49:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions. [2022-04-15 17:49:30,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 535 transitions. [2022-04-15 17:49:31,183 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-15 17:49:31,190 INFO L225 Difference]: With dead ends: 579 [2022-04-15 17:49:31,190 INFO L226 Difference]: Without dead ends: 300 [2022-04-15 17:49:31,191 INFO L912 BasicCegarLoop]: 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-15 17:49:31,192 INFO L913 BasicCegarLoop]: 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-15 17:49:31,192 INFO L914 BasicCegarLoop]: 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-15 17:49:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-15 17:49:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-15 17:49:31,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:31,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-15 17:49:31,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-15 17:49:31,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-15 17:49:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:31,257 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-15 17:49:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-15 17:49:31,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:31,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:31,259 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-15 17:49:31,259 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-15 17:49:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:31,266 INFO L93 Difference]: Finished difference Result 300 states and 443 transitions. [2022-04-15 17:49:31,266 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2022-04-15 17:49:31,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:31,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:31,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:31,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:31,268 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-15 17:49:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 436 transitions. [2022-04-15 17:49:31,275 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 436 transitions. Word has length 44 [2022-04-15 17:49:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:31,275 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 436 transitions. [2022-04-15 17:49:31,275 INFO L479 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-15 17:49:31,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 295 states and 436 transitions. [2022-04-15 17:49:31,889 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-15 17:49:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 436 transitions. [2022-04-15 17:49:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 17:49:31,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:31,892 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:31,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 17:49:31,893 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 1 times [2022-04-15 17:49:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [677350465] [2022-04-15 17:49:31,895 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -970621315, now seen corresponding path program 2 times [2022-04-15 17:49:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942348443] [2022-04-15 17:49:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:31,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:31,998 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-15 17:49:31,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-15 17:49:31,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-15 17:49:31,999 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-15 17:49:31,999 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-15 17:49:31,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {27809#true} assume true; {27809#true} is VALID [2022-04-15 17:49:31,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27809#true} {27809#true} #752#return; {27809#true} is VALID [2022-04-15 17:49:31,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {27809#true} call #t~ret59 := main(); {27809#true} is VALID [2022-04-15 17:49:32,000 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-15 17:49:32,000 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-15 17:49:32,002 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:32,002 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-15 17:49:32,003 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-15 17:49:32,003 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-15 17:49:32,003 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-15 17:49:32,004 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-15 17:49:32,004 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-15 17:49:32,004 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-15 17:49:32,005 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-15 17:49:32,005 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-15 17:49:32,005 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-15 17:49:32,011 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-15 17:49:32,011 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-15 17:49:32,011 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-15 17:49:32,012 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-15 17:49:32,012 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-15 17:49:32,012 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-15 17:49:32,013 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-15 17:49:32,013 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-15 17:49:32,013 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-15 17:49:32,013 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-15 17:49:32,014 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-15 17:49:32,014 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-15 17:49:32,014 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-15 17:49:32,015 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-15 17:49:32,015 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-15 17:49:32,015 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-15 17:49:32,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {27810#false} assume 0 == ~s__s3__tmp__reuse_message~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {27810#false} assume 0 == ~skip~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {27810#false} assume 8560 == ~state~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {27810#false} assume 8448 == ~s__state~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 38: Hoare triple {27810#false} assume -1 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {27810#false} assume -2 != ~s__verify_mode~0; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {27810#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {27810#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {27810#false} is VALID [2022-04-15 17:49:32,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {27810#false} assume 4 != ~blastFlag~0; {27810#false} is VALID [2022-04-15 17:49:32,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {27810#false} assume 1024 != ~tmp___7~0; {27810#false} is VALID [2022-04-15 17:49:32,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {27810#false} assume !false; {27810#false} is VALID [2022-04-15 17:49:32,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-15 17:49:32,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:32,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942348443] [2022-04-15 17:49:32,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942348443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:32,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:32,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:32,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:32,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [677350465] [2022-04-15 17:49:32,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [677350465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:32,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:32,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128088162] [2022-04-15 17:49:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:32,019 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-15 17:49:32,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:32,019 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-15 17:49:32,047 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-15 17:49:32,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:32,047 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-15 17:49:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:32,871 INFO L93 Difference]: Finished difference Result 615 states and 910 transitions. [2022-04-15 17:49:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:32,872 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-15 17:49:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:32,872 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-15 17:49:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-15 17:49:32,874 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-15 17:49:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2022-04-15 17:49:32,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 548 transitions. [2022-04-15 17:49:33,235 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-15 17:49:33,242 INFO L225 Difference]: With dead ends: 615 [2022-04-15 17:49:33,242 INFO L226 Difference]: Without dead ends: 334 [2022-04-15 17:49:33,243 INFO L912 BasicCegarLoop]: 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-15 17:49:33,243 INFO L913 BasicCegarLoop]: 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-15 17:49:33,244 INFO L914 BasicCegarLoop]: 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-15 17:49:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-04-15 17:49:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 325. [2022-04-15 17:49:33,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:33,303 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-15 17:49:33,304 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-15 17:49:33,304 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-15 17:49:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:33,311 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-15 17:49:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-15 17:49:33,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:33,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:33,312 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-15 17:49:33,313 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-15 17:49:33,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:33,319 INFO L93 Difference]: Finished difference Result 334 states and 491 transitions. [2022-04-15 17:49:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 491 transitions. [2022-04-15 17:49:33,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:33,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:33,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:33,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:33,321 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-15 17:49:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2022-04-15 17:49:33,328 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2022-04-15 17:49:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:33,328 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2022-04-15 17:49:33,329 INFO L479 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-15 17:49:33,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 476 transitions. [2022-04-15 17:49:34,056 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-15 17:49:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2022-04-15 17:49:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 17:49:34,059 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:34,059 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:34,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 17:49:34,059 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 1 times [2022-04-15 17:49:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427646876] [2022-04-15 17:49:34,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -957955839, now seen corresponding path program 2 times [2022-04-15 17:49:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:34,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778941574] [2022-04-15 17:49:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:34,120 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-15 17:49:34,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-15 17:49:34,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-15 17:49:34,121 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-15 17:49:34,121 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-15 17:49:34,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {30374#true} assume true; {30374#true} is VALID [2022-04-15 17:49:34,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30374#true} {30374#true} #752#return; {30374#true} is VALID [2022-04-15 17:49:34,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {30374#true} call #t~ret59 := main(); {30374#true} is VALID [2022-04-15 17:49:34,122 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-15 17:49:34,125 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-15 17:49:34,127 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:34,127 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-15 17:49:34,127 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-15 17:49:34,128 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-15 17:49:34,128 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-15 17:49:34,128 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-15 17:49:34,128 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-15 17:49:34,129 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-15 17:49:34,129 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-15 17:49:34,129 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-15 17:49:34,130 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-15 17:49:34,130 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-15 17:49:34,130 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-15 17:49:34,130 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-15 17:49:34,131 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-15 17:49:34,131 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-15 17:49:34,131 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-15 17:49:34,132 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-15 17:49:34,132 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-15 17:49:34,132 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-15 17:49:34,132 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-15 17:49:34,133 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-15 17:49:34,133 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-15 17:49:34,143 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-15 17:49:34,144 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-15 17:49:34,144 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-15 17:49:34,144 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-15 17:49:34,144 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-15 17:49:34,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {30375#false} assume 0 == ~s__s3__tmp__reuse_message~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {30375#false} assume 0 == ~skip~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {30375#false} assume 8560 == ~state~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {30375#false} assume 8448 == ~s__state~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {30375#false} assume -1 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {30375#false} assume -2 != ~s__verify_mode~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {30375#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {30375#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {30375#false} assume 4 != ~blastFlag~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {30375#false} assume 1024 != ~tmp___7~0; {30375#false} is VALID [2022-04-15 17:49:34,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {30375#false} assume !false; {30375#false} is VALID [2022-04-15 17:49:34,145 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-15 17:49:34,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:34,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778941574] [2022-04-15 17:49:34,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778941574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:34,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:34,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:34,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:34,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427646876] [2022-04-15 17:49:34,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427646876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:34,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:34,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355741810] [2022-04-15 17:49:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:34,147 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-15 17:49:34,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:34,147 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-15 17:49:34,186 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-15 17:49:34,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:34,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:34,187 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-15 17:49:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:35,050 INFO L93 Difference]: Finished difference Result 649 states and 957 transitions. [2022-04-15 17:49:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:35,050 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-15 17:49:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:35,051 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-15 17:49:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-15 17:49:35,053 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-15 17:49:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 550 transitions. [2022-04-15 17:49:35,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 550 transitions. [2022-04-15 17:49:35,416 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-15 17:49:35,421 INFO L225 Difference]: With dead ends: 649 [2022-04-15 17:49:35,421 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 17:49:35,422 INFO L912 BasicCegarLoop]: 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-15 17:49:35,422 INFO L913 BasicCegarLoop]: 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-15 17:49:35,422 INFO L914 BasicCegarLoop]: 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-15 17:49:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 17:49:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 329. [2022-04-15 17:49:35,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:35,475 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-15 17:49:35,476 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-15 17:49:35,476 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-15 17:49:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:35,483 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-15 17:49:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-15 17:49:35,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:35,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:35,484 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-15 17:49:35,485 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-15 17:49:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:35,491 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2022-04-15 17:49:35,491 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2022-04-15 17:49:35,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:35,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:35,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:35,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:35,493 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-15 17:49:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 483 transitions. [2022-04-15 17:49:35,500 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 483 transitions. Word has length 46 [2022-04-15 17:49:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:35,501 INFO L478 AbstractCegarLoop]: Abstraction has 329 states and 483 transitions. [2022-04-15 17:49:35,501 INFO L479 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-15 17:49:35,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 329 states and 483 transitions. [2022-04-15 17:49:36,220 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-15 17:49:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 483 transitions. [2022-04-15 17:49:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 17:49:36,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:36,221 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:36,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 17:49:36,221 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 1 times [2022-04-15 17:49:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2053242064] [2022-04-15 17:49:36,222 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:36,222 INFO L85 PathProgramCache]: Analyzing trace with hash 14351293, now seen corresponding path program 2 times [2022-04-15 17:49:36,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:36,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266963366] [2022-04-15 17:49:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:36,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:36,285 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-15 17:49:36,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-15 17:49:36,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-15 17:49:36,286 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-15 17:49:36,286 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-15 17:49:36,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {33023#true} assume true; {33023#true} is VALID [2022-04-15 17:49:36,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33023#true} {33023#true} #752#return; {33023#true} is VALID [2022-04-15 17:49:36,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {33023#true} call #t~ret59 := main(); {33023#true} is VALID [2022-04-15 17:49:36,286 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-15 17:49:36,287 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-15 17:49:36,289 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:36,289 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-15 17:49:36,290 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-15 17:49:36,290 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-15 17:49:36,290 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-15 17:49:36,291 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-15 17:49:36,291 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-15 17:49:36,291 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-15 17:49:36,291 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-15 17:49:36,292 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-15 17:49:36,292 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-15 17:49:36,292 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-15 17:49:36,293 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-15 17:49:36,293 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-15 17:49:36,293 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-15 17:49:36,293 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-15 17:49:36,294 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-15 17:49:36,294 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-15 17:49:36,294 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-15 17:49:36,295 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-15 17:49:36,295 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-15 17:49:36,295 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-15 17:49:36,296 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-15 17:49:36,296 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-15 17:49:36,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {33024#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 18446744073709551616);~s__s3__tmp__use_rsa_tmp~0 := 0; {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {33024#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {33024#false} assume !(0 != (30 + ~l~0) % 18446744073709551616); {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {33024#false} assume !(0 != (1 + ~l~0) % 18446744073709551616);~skip~0 := 1; {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {33024#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {33024#false} is VALID [2022-04-15 17:49:36,296 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-15 17:49:36,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {33024#false} assume 0 == ~s__s3__tmp__reuse_message~0; {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {33024#false} assume 0 == ~skip~0; {33024#false} is VALID [2022-04-15 17:49:36,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {33024#false} assume 8560 == ~state~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {33024#false} assume 8448 == ~s__state~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {33024#false} assume -1 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {33024#false} assume -2 != ~s__verify_mode~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {33024#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {33024#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {33024#false} assume 4 != ~blastFlag~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 46: Hoare triple {33024#false} assume 1024 != ~tmp___7~0; {33024#false} is VALID [2022-04-15 17:49:36,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {33024#false} assume !false; {33024#false} is VALID [2022-04-15 17:49:36,297 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-15 17:49:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266963366] [2022-04-15 17:49:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266963366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:36,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:36,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:36,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2053242064] [2022-04-15 17:49:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2053242064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:36,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:36,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:36,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258457250] [2022-04-15 17:49:36,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:36,299 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-15 17:49:36,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:36,299 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-15 17:49:36,329 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-15 17:49:36,329 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:36,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:36,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:36,330 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-15 17:49:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:37,161 INFO L93 Difference]: Finished difference Result 686 states and 1008 transitions. [2022-04-15 17:49:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:37,161 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-15 17:49:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:37,162 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-15 17:49:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 17:49:37,165 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-15 17:49:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 17:49:37,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-15 17:49:37,528 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-15 17:49:37,534 INFO L225 Difference]: With dead ends: 686 [2022-04-15 17:49:37,534 INFO L226 Difference]: Without dead ends: 371 [2022-04-15 17:49:37,535 INFO L912 BasicCegarLoop]: 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-15 17:49:37,535 INFO L913 BasicCegarLoop]: 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-15 17:49:37,535 INFO L914 BasicCegarLoop]: 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-15 17:49:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-15 17:49:37,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 357. [2022-04-15 17:49:37,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:37,616 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-15 17:49:37,616 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-15 17:49:37,617 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-15 17:49:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:37,624 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-15 17:49:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-15 17:49:37,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:37,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:37,625 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-15 17:49:37,626 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-15 17:49:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:37,633 INFO L93 Difference]: Finished difference Result 371 states and 541 transitions. [2022-04-15 17:49:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 541 transitions. [2022-04-15 17:49:37,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:37,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:37,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:37,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:37,635 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-15 17:49:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-04-15 17:49:37,644 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 48 [2022-04-15 17:49:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:37,644 INFO L478 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-04-15 17:49:37,644 INFO L479 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-15 17:49:37,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 357 states and 518 transitions. [2022-04-15 17:49:38,463 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-15 17:49:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-04-15 17:49:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 17:49:38,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:38,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:38,464 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 17:49:38,464 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:38,464 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 1 times [2022-04-15 17:49:38,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:38,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759832770] [2022-04-15 17:49:38,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -447006304, now seen corresponding path program 2 times [2022-04-15 17:49:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:38,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367061200] [2022-04-15 17:49:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:38,534 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-15 17:49:38,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-15 17:49:38,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-15 17:49:38,535 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-15 17:49:38,535 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-15 17:49:38,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {35868#true} assume true; {35868#true} is VALID [2022-04-15 17:49:38,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35868#true} {35868#true} #752#return; {35868#true} is VALID [2022-04-15 17:49:38,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {35868#true} call #t~ret59 := main(); {35868#true} is VALID [2022-04-15 17:49:38,535 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-15 17:49:38,536 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-15 17:49:38,538 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:38,538 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-15 17:49:38,538 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-15 17:49:38,539 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-15 17:49:38,539 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-15 17:49:38,539 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-15 17:49:38,539 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-15 17:49:38,540 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-15 17:49:38,540 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-15 17:49:38,540 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-15 17:49:38,541 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-15 17:49:38,541 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-15 17:49:38,541 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-15 17:49:38,542 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-15 17:49:38,542 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-15 17:49:38,542 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-15 17:49:38,543 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-15 17:49:38,543 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-15 17:49:38,543 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-15 17:49:38,544 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-15 17:49:38,544 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-15 17:49:38,544 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-15 17:49:38,544 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-15 17:49:38,545 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-15 17:49:38,545 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-15 17:49:38,545 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-15 17:49:38,546 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-15 17:49:38,546 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-15 17:49:38,546 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-15 17:49:38,546 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-15 17:49:38,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {35869#false} assume 0 == ~s__s3__tmp__reuse_message~0; {35869#false} is VALID [2022-04-15 17:49:38,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {35869#false} assume 0 == ~skip~0; {35869#false} is VALID [2022-04-15 17:49:38,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {35869#false} assume 8560 == ~state~0; {35869#false} is VALID [2022-04-15 17:49:38,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {35869#false} assume 8448 == ~s__state~0; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {35869#false} assume -1 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {35869#false} assume -2 != ~s__verify_mode~0; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {35869#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {35869#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {35869#false} assume 4 != ~blastFlag~0; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {35869#false} assume 1024 != ~tmp___7~0; {35869#false} is VALID [2022-04-15 17:49:38,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {35869#false} assume !false; {35869#false} is VALID [2022-04-15 17:49:38,547 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-15 17:49:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367061200] [2022-04-15 17:49:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367061200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:38,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759832770] [2022-04-15 17:49:38,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759832770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:38,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:38,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448661841] [2022-04-15 17:49:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:38,549 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-15 17:49:38,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:38,549 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-15 17:49:38,588 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-15 17:49:38,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:38,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:38,589 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-15 17:49:39,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,394 INFO L93 Difference]: Finished difference Result 734 states and 1062 transitions. [2022-04-15 17:49:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:39,394 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-15 17:49:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:39,394 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-15 17:49:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-15 17:49:39,396 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-15 17:49:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2022-04-15 17:49:39,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 538 transitions. [2022-04-15 17:49:39,758 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-15 17:49:39,766 INFO L225 Difference]: With dead ends: 734 [2022-04-15 17:49:39,766 INFO L226 Difference]: Without dead ends: 391 [2022-04-15 17:49:39,767 INFO L912 BasicCegarLoop]: 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-15 17:49:39,767 INFO L913 BasicCegarLoop]: 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-15 17:49:39,767 INFO L914 BasicCegarLoop]: 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-15 17:49:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-15 17:49:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2022-04-15 17:49:39,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:39,832 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-15 17:49:39,833 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-15 17:49:39,833 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-15 17:49:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,842 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-15 17:49:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-15 17:49:39,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:39,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:39,844 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-15 17:49:39,844 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-15 17:49:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,853 INFO L93 Difference]: Finished difference Result 391 states and 561 transitions. [2022-04-15 17:49:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 561 transitions. [2022-04-15 17:49:39,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:39,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:39,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:39,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:39,855 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-15 17:49:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 559 transitions. [2022-04-15 17:49:39,865 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 559 transitions. Word has length 48 [2022-04-15 17:49:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:39,866 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 559 transitions. [2022-04-15 17:49:39,866 INFO L479 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-15 17:49:39,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 559 transitions. [2022-04-15 17:49:40,992 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-15 17:49:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 559 transitions. [2022-04-15 17:49:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 17:49:40,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:40,993 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:40,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 17:49:40,994 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 1 times [2022-04-15 17:49:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:40,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [225093240] [2022-04-15 17:49:40,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1888205337, now seen corresponding path program 2 times [2022-04-15 17:49:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:40,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763112228] [2022-04-15 17:49:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:41,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:41,077 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-15 17:49:41,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-15 17:49:41,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-15 17:49:41,077 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-15 17:49:41,078 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-15 17:49:41,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {38913#true} assume true; {38913#true} is VALID [2022-04-15 17:49:41,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38913#true} {38913#true} #752#return; {38913#true} is VALID [2022-04-15 17:49:41,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {38913#true} call #t~ret59 := main(); {38913#true} is VALID [2022-04-15 17:49:41,078 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-15 17:49:41,079 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-15 17:49:41,080 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:41,080 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-15 17:49:41,081 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-15 17:49:41,081 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-15 17:49:41,081 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-15 17:49:41,082 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-15 17:49:41,082 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-15 17:49:41,082 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-15 17:49:41,082 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-15 17:49:41,083 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-15 17:49:41,083 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-15 17:49:41,083 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-15 17:49:41,084 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-15 17:49:41,084 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-15 17:49:41,084 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-15 17:49:41,085 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-15 17:49:41,085 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-15 17:49:41,085 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-15 17:49:41,085 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-15 17:49:41,086 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-15 17:49:41,086 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-15 17:49:41,086 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-15 17:49:41,087 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-15 17:49:41,087 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-15 17:49:41,087 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-15 17:49:41,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {38914#false} assume !(0 != (2097152 + ~__cil_tmp57~0) % 18446744073709551616);~s__s3__tmp__use_rsa_tmp~0 := 0; {38914#false} is VALID [2022-04-15 17:49:41,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {38914#false} assume !(0 != ~s__s3__tmp__use_rsa_tmp~0); {38914#false} is VALID [2022-04-15 17:49:41,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {38914#false} assume !(0 != (30 + ~l~0) % 18446744073709551616); {38914#false} is VALID [2022-04-15 17:49:41,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {38914#false} assume !(0 != (1 + ~l~0) % 18446744073709551616);~skip~0 := 1; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {38914#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {38914#false} is VALID [2022-04-15 17:49:41,088 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-15 17:49:41,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {38914#false} assume 0 == ~s__s3__tmp__reuse_message~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {38914#false} assume 0 == ~skip~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {38914#false} assume 8560 == ~state~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {38914#false} assume 8448 == ~s__state~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {38914#false} assume -1 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {38914#false} assume -2 != ~s__verify_mode~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {38914#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {38914#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {38914#false} assume 4 != ~blastFlag~0; {38914#false} is VALID [2022-04-15 17:49:41,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {38914#false} assume 1024 != ~tmp___7~0; {38914#false} is VALID [2022-04-15 17:49:41,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {38914#false} assume !false; {38914#false} is VALID [2022-04-15 17:49:41,089 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-15 17:49:41,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:41,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763112228] [2022-04-15 17:49:41,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763112228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:41,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:41,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:41,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:41,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [225093240] [2022-04-15 17:49:41,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [225093240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:41,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:41,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:41,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961787031] [2022-04-15 17:49:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:41,091 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-15 17:49:41,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:41,092 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-15 17:49:41,128 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-15 17:49:41,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:41,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:41,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:41,131 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-15 17:49:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:41,993 INFO L93 Difference]: Finished difference Result 778 states and 1123 transitions. [2022-04-15 17:49:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:41,993 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-15 17:49:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:41,993 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-15 17:49:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-15 17:49:41,996 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-15 17:49:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2022-04-15 17:49:41,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 554 transitions. [2022-04-15 17:49:42,381 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-15 17:49:42,388 INFO L225 Difference]: With dead ends: 778 [2022-04-15 17:49:42,388 INFO L226 Difference]: Without dead ends: 403 [2022-04-15 17:49:42,389 INFO L912 BasicCegarLoop]: 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-15 17:49:42,390 INFO L913 BasicCegarLoop]: 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-15 17:49:42,390 INFO L914 BasicCegarLoop]: 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-15 17:49:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-15 17:49:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 389. [2022-04-15 17:49:42,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:42,469 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-15 17:49:42,469 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-15 17:49:42,470 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-15 17:49:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:42,479 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-15 17:49:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-15 17:49:42,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:42,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:42,480 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-15 17:49:42,481 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-15 17:49:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:42,491 INFO L93 Difference]: Finished difference Result 403 states and 579 transitions. [2022-04-15 17:49:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 579 transitions. [2022-04-15 17:49:42,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:42,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:42,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:42,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:42,492 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-15 17:49:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 556 transitions. [2022-04-15 17:49:42,503 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 556 transitions. Word has length 49 [2022-04-15 17:49:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:42,503 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 556 transitions. [2022-04-15 17:49:42,503 INFO L479 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-15 17:49:42,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 556 transitions. [2022-04-15 17:49:43,403 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-15 17:49:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 556 transitions. [2022-04-15 17:49:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 17:49:43,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:43,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:43,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 17:49:43,404 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 1 times [2022-04-15 17:49:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544761711] [2022-04-15 17:49:43,405 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash -396811972, now seen corresponding path program 2 times [2022-04-15 17:49:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903063210] [2022-04-15 17:49:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:43,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:43,487 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-15 17:49:43,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-15 17:49:43,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-15 17:49:43,488 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-15 17:49:43,488 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-15 17:49:43,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {42070#true} assume true; {42070#true} is VALID [2022-04-15 17:49:43,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42070#true} {42070#true} #752#return; {42070#true} is VALID [2022-04-15 17:49:43,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {42070#true} call #t~ret59 := main(); {42070#true} is VALID [2022-04-15 17:49:43,488 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-15 17:49:43,489 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-15 17:49:43,490 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:43,491 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-15 17:49:43,491 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-15 17:49:43,491 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-15 17:49:43,491 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-15 17:49:43,492 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-15 17:49:43,492 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-15 17:49:43,492 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-15 17:49:43,493 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-15 17:49:43,493 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-15 17:49:43,493 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-15 17:49:43,494 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-15 17:49:43,494 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-15 17:49:43,494 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-15 17:49:43,494 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-15 17:49:43,495 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-15 17:49:43,495 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-15 17:49:43,495 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-15 17:49:43,496 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-15 17:49:43,496 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-15 17:49:43,496 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-15 17:49:43,497 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-15 17:49:43,497 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-15 17:49:43,497 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-15 17:49:43,497 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-15 17:49:43,498 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-15 17:49:43,498 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-15 17:49:43,498 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-15 17:49:43,499 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-15 17:49:43,499 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-15 17:49:43,499 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-15 17:49:43,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {42071#false} assume 0 == ~s__s3__tmp__reuse_message~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {42071#false} assume 0 == ~skip~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {42071#false} assume 8560 == ~state~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {42071#false} assume 8448 == ~s__state~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {42071#false} assume -1 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {42071#false} assume -2 != ~s__verify_mode~0; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {42071#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {42071#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {42071#false} is VALID [2022-04-15 17:49:43,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {42071#false} assume 4 != ~blastFlag~0; {42071#false} is VALID [2022-04-15 17:49:43,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {42071#false} assume 1024 != ~tmp___7~0; {42071#false} is VALID [2022-04-15 17:49:43,500 INFO L290 TraceCheckUtils]: 48: Hoare triple {42071#false} assume !false; {42071#false} is VALID [2022-04-15 17:49:43,500 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-15 17:49:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903063210] [2022-04-15 17:49:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903063210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:43,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:43,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:43,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544761711] [2022-04-15 17:49:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544761711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154837202] [2022-04-15 17:49:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:43,501 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-15 17:49:43,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:43,501 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-15 17:49:43,533 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-15 17:49:43,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:43,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:43,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:43,534 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-15 17:49:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:44,509 INFO L93 Difference]: Finished difference Result 768 states and 1100 transitions. [2022-04-15 17:49:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:44,509 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-15 17:49:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:44,509 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-15 17:49:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-15 17:49:44,512 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-15 17:49:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-04-15 17:49:44,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 539 transitions. [2022-04-15 17:49:44,853 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-15 17:49:44,861 INFO L225 Difference]: With dead ends: 768 [2022-04-15 17:49:44,861 INFO L226 Difference]: Without dead ends: 393 [2022-04-15 17:49:44,862 INFO L912 BasicCegarLoop]: 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-15 17:49:44,863 INFO L913 BasicCegarLoop]: 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-15 17:49:44,863 INFO L914 BasicCegarLoop]: 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-15 17:49:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-15 17:49:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2022-04-15 17:49:44,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:44,961 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-15 17:49:44,962 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-15 17:49:44,962 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-15 17:49:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:44,971 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-15 17:49:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-15 17:49:44,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:44,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:44,972 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-15 17:49:44,973 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-15 17:49:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:44,981 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2022-04-15 17:49:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 561 transitions. [2022-04-15 17:49:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:44,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:44,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:44,983 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-15 17:49:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 559 transitions. [2022-04-15 17:49:44,994 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 559 transitions. Word has length 49 [2022-04-15 17:49:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:44,994 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 559 transitions. [2022-04-15 17:49:44,994 INFO L479 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-15 17:49:44,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 559 transitions. [2022-04-15 17:49:45,934 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-15 17:49:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 559 transitions. [2022-04-15 17:49:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 17:49:45,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:45,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:45,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 17:49:45,935 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:45,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 1 times [2022-04-15 17:49:45,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:45,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611384573] [2022-04-15 17:49:45,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:45,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1088761570, now seen corresponding path program 2 times [2022-04-15 17:49:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172798110] [2022-04-15 17:49:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:46,019 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-15 17:49:46,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-15 17:49:46,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-15 17:49:46,020 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-15 17:49:46,020 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-15 17:49:46,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {45191#true} assume true; {45191#true} is VALID [2022-04-15 17:49:46,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45191#true} {45191#true} #752#return; {45191#true} is VALID [2022-04-15 17:49:46,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {45191#true} call #t~ret59 := main(); {45191#true} is VALID [2022-04-15 17:49:46,020 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-15 17:49:46,021 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-15 17:49:46,023 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:46,023 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-15 17:49:46,023 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-15 17:49:46,023 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-15 17:49:46,024 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-15 17:49:46,024 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-15 17:49:46,024 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-15 17:49:46,025 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-15 17:49:46,025 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-15 17:49:46,025 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-15 17:49:46,026 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-15 17:49:46,026 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-15 17:49:46,026 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-15 17:49:46,026 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-15 17:49:46,027 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-15 17:49:46,027 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-15 17:49:46,027 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-15 17:49:46,028 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-15 17:49:46,028 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-15 17:49:46,028 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-15 17:49:46,029 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-15 17:49:46,029 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-15 17:49:46,029 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-15 17:49:46,029 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-15 17:49:46,030 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-15 17:49:46,030 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-15 17:49:46,030 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-15 17:49:46,031 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-15 17:49:46,031 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-15 17:49:46,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {45192#false} assume !(~num1~0 > 0); {45192#false} is VALID [2022-04-15 17:49:46,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {45192#false} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {45192#false} is VALID [2022-04-15 17:49:46,031 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-15 17:49:46,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {45192#false} assume 0 == ~s__s3__tmp__reuse_message~0; {45192#false} is VALID [2022-04-15 17:49:46,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {45192#false} assume 0 == ~skip~0; {45192#false} is VALID [2022-04-15 17:49:46,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {45192#false} assume 8560 == ~state~0; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {45192#false} assume 8448 == ~s__state~0; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {45192#false} assume -1 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {45192#false} assume -2 != ~s__verify_mode~0; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {45192#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {45192#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {45192#false} is VALID [2022-04-15 17:49:46,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {45192#false} assume 4 != ~blastFlag~0; {45192#false} is VALID [2022-04-15 17:49:46,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {45192#false} assume 1024 != ~tmp___7~0; {45192#false} is VALID [2022-04-15 17:49:46,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {45192#false} assume !false; {45192#false} is VALID [2022-04-15 17:49:46,034 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-15 17:49:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172798110] [2022-04-15 17:49:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172798110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:46,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611384573] [2022-04-15 17:49:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611384573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125220707] [2022-04-15 17:49:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:46,036 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-15 17:49:46,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:46,036 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-15 17:49:46,072 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-15 17:49:46,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:46,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:46,074 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-15 17:49:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:47,002 INFO L93 Difference]: Finished difference Result 832 states and 1196 transitions. [2022-04-15 17:49:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:47,002 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-15 17:49:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:47,002 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-15 17:49:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 17:49:47,005 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-15 17:49:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 552 transitions. [2022-04-15 17:49:47,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 552 transitions. [2022-04-15 17:49:47,356 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-15 17:49:47,365 INFO L225 Difference]: With dead ends: 832 [2022-04-15 17:49:47,365 INFO L226 Difference]: Without dead ends: 455 [2022-04-15 17:49:47,366 INFO L912 BasicCegarLoop]: 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-15 17:49:47,366 INFO L913 BasicCegarLoop]: 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-15 17:49:47,366 INFO L914 BasicCegarLoop]: 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-15 17:49:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-04-15 17:49:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-04-15 17:49:47,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:47,456 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-15 17:49:47,456 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-15 17:49:47,457 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-15 17:49:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:47,467 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-15 17:49:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-15 17:49:47,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:47,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:47,469 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-15 17:49:47,469 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-15 17:49:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:47,480 INFO L93 Difference]: Finished difference Result 455 states and 646 transitions. [2022-04-15 17:49:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 646 transitions. [2022-04-15 17:49:47,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:47,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:47,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:47,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:47,482 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-15 17:49:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 645 transitions. [2022-04-15 17:49:47,500 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 645 transitions. Word has length 50 [2022-04-15 17:49:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:47,500 INFO L478 AbstractCegarLoop]: Abstraction has 453 states and 645 transitions. [2022-04-15 17:49:47,500 INFO L479 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-15 17:49:47,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 453 states and 645 transitions. [2022-04-15 17:49:48,565 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-15 17:49:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 645 transitions. [2022-04-15 17:49:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 17:49:48,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:48,566 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:48,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 17:49:48,566 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 1 times [2022-04-15 17:49:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670969761] [2022-04-15 17:49:48,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1090858659, now seen corresponding path program 2 times [2022-04-15 17:49:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199620350] [2022-04-15 17:49:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:48,635 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-15 17:49:48,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-15 17:49:48,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-15 17:49:48,635 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-15 17:49:48,635 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-15 17:49:48,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {48688#true} assume true; {48688#true} is VALID [2022-04-15 17:49:48,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48688#true} {48688#true} #752#return; {48688#true} is VALID [2022-04-15 17:49:48,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {48688#true} call #t~ret59 := main(); {48688#true} is VALID [2022-04-15 17:49:48,636 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-15 17:49:48,637 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-15 17:49:48,638 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:48,638 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-15 17:49:48,639 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-15 17:49:48,639 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-15 17:49:48,639 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-15 17:49:48,640 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-15 17:49:48,640 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-15 17:49:48,640 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-15 17:49:48,641 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-15 17:49:48,641 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-15 17:49:48,641 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-15 17:49:48,642 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-15 17:49:48,642 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-15 17:49:48,642 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-15 17:49:48,642 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-15 17:49:48,643 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-15 17:49:48,643 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-15 17:49:48,643 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-15 17:49:48,644 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-15 17:49:48,644 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-15 17:49:48,644 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-15 17:49:48,645 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-15 17:49:48,645 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-15 17:49:48,645 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-15 17:49:48,646 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-15 17:49:48,646 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-15 17:49:48,646 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-15 17:49:48,646 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-15 17:49:48,647 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-15 17:49:48,647 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-15 17:49:48,648 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-15 17:49:48,648 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-15 17:49:48,648 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-15 17:49:48,648 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-15 17:49:48,649 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-15 17:49:48,649 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-15 17:49:48,649 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-15 17:49:48,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {48689#false} assume !(9 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 17:49:48,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {48689#false} assume !(12 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 17:49:48,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {48689#false} assume !(15 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 17:49:48,649 INFO L290 TraceCheckUtils]: 47: Hoare triple {48689#false} assume !(18 == ~blastFlag~0); {48689#false} is VALID [2022-04-15 17:49:48,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {48689#false} assume 21 == ~blastFlag~0; {48689#false} is VALID [2022-04-15 17:49:48,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {48689#false} assume !false; {48689#false} is VALID [2022-04-15 17:49:48,650 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-15 17:49:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:48,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199620350] [2022-04-15 17:49:48,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199620350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:48,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:48,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:48,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:48,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670969761] [2022-04-15 17:49:48,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670969761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:48,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:48,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263193074] [2022-04-15 17:49:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:48,651 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-15 17:49:48,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:48,652 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-15 17:49:48,689 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-15 17:49:48,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:48,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:48,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:48,690 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-15 17:49:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:49,645 INFO L93 Difference]: Finished difference Result 944 states and 1344 transitions. [2022-04-15 17:49:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:49,645 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-15 17:49:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:49,646 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-15 17:49:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-15 17:49:49,648 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-15 17:49:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2022-04-15 17:49:49,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 567 transitions. [2022-04-15 17:49:50,012 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-15 17:49:50,023 INFO L225 Difference]: With dead ends: 944 [2022-04-15 17:49:50,023 INFO L226 Difference]: Without dead ends: 505 [2022-04-15 17:49:50,023 INFO L912 BasicCegarLoop]: 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-15 17:49:50,024 INFO L913 BasicCegarLoop]: 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-15 17:49:50,024 INFO L914 BasicCegarLoop]: 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-15 17:49:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-15 17:49:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 495. [2022-04-15 17:49:50,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:50,132 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-15 17:49:50,132 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-15 17:49:50,133 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-15 17:49:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:50,145 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-15 17:49:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-15 17:49:50,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:50,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:50,147 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-15 17:49:50,147 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-15 17:49:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:50,160 INFO L93 Difference]: Finished difference Result 505 states and 716 transitions. [2022-04-15 17:49:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 716 transitions. [2022-04-15 17:49:50,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:50,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:50,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:50,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:50,162 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-15 17:49:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 701 transitions. [2022-04-15 17:49:50,178 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 701 transitions. Word has length 50 [2022-04-15 17:49:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:50,178 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 701 transitions. [2022-04-15 17:49:50,178 INFO L479 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-15 17:49:50,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 701 transitions. [2022-04-15 17:49:51,598 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-15 17:49:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 701 transitions. [2022-04-15 17:49:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 17:49:51,598 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:51,598 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:51,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 17:49:51,599 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 1 times [2022-04-15 17:49:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [203529292] [2022-04-15 17:49:51,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -163662636, now seen corresponding path program 2 times [2022-04-15 17:49:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065648415] [2022-04-15 17:49:51,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:51,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:51,659 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-15 17:49:51,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-15 17:49:51,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-15 17:49:51,660 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-15 17:49:51,660 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-15 17:49:51,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {52593#true} assume true; {52593#true} is VALID [2022-04-15 17:49:51,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52593#true} {52593#true} #752#return; {52593#true} is VALID [2022-04-15 17:49:51,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {52593#true} call #t~ret59 := main(); {52593#true} is VALID [2022-04-15 17:49:51,661 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-15 17:49:51,661 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-15 17:49:51,663 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:51,663 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-15 17:49:51,663 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-15 17:49:51,664 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-15 17:49:51,664 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-15 17:49:51,664 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-15 17:49:51,664 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-15 17:49:51,665 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-15 17:49:51,665 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-15 17:49:51,665 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-15 17:49:51,666 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-15 17:49:51,666 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-15 17:49:51,666 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-15 17:49:51,666 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-15 17:49:51,667 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-15 17:49:51,667 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-15 17:49:51,667 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-15 17:49:51,668 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-15 17:49:51,668 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-15 17:49:51,668 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-15 17:49:51,668 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-15 17:49:51,669 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-15 17:49:51,669 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-15 17:49:51,669 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-15 17:49:51,670 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-15 17:49:51,670 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-15 17:49:51,670 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-15 17:49:51,671 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-15 17:49:51,671 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-15 17:49:51,671 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-15 17:49:51,671 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-15 17:49:51,672 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-15 17:49:51,672 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-15 17:49:51,672 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-15 17:49:51,672 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-15 17:49:51,673 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-15 17:49:51,673 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-15 17:49:51,673 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-15 17:49:51,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {52594#false} assume !(9 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 17:49:51,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {52594#false} assume !(12 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 17:49:51,673 INFO L290 TraceCheckUtils]: 47: Hoare triple {52594#false} assume !(15 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 17:49:51,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {52594#false} assume !(18 == ~blastFlag~0); {52594#false} is VALID [2022-04-15 17:49:51,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {52594#false} assume 21 == ~blastFlag~0; {52594#false} is VALID [2022-04-15 17:49:51,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {52594#false} assume !false; {52594#false} is VALID [2022-04-15 17:49:51,674 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-15 17:49:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:51,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065648415] [2022-04-15 17:49:51,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065648415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:51,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:51,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:51,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:51,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [203529292] [2022-04-15 17:49:51,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [203529292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:51,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:51,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091412293] [2022-04-15 17:49:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:51,675 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-15 17:49:51,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:51,676 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-15 17:49:51,709 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-15 17:49:51,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:51,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:51,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:51,710 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-15 17:49:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:52,704 INFO L93 Difference]: Finished difference Result 995 states and 1416 transitions. [2022-04-15 17:49:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:52,704 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-15 17:49:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:52,704 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-15 17:49:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 17:49:52,706 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-15 17:49:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 17:49:52,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-15 17:49:53,072 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-15 17:49:53,083 INFO L225 Difference]: With dead ends: 995 [2022-04-15 17:49:53,083 INFO L226 Difference]: Without dead ends: 514 [2022-04-15 17:49:53,084 INFO L912 BasicCegarLoop]: 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-15 17:49:53,084 INFO L913 BasicCegarLoop]: 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-15 17:49:53,084 INFO L914 BasicCegarLoop]: 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-15 17:49:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-04-15 17:49:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2022-04-15 17:49:53,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:53,206 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-15 17:49:53,207 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-15 17:49:53,208 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-15 17:49:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:53,220 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-15 17:49:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-15 17:49:53,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:53,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:53,222 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-15 17:49:53,222 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-15 17:49:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:53,236 INFO L93 Difference]: Finished difference Result 514 states and 732 transitions. [2022-04-15 17:49:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 732 transitions. [2022-04-15 17:49:53,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:53,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:53,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:53,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:53,237 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-15 17:49:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 717 transitions. [2022-04-15 17:49:53,253 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 717 transitions. Word has length 51 [2022-04-15 17:49:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:53,253 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 717 transitions. [2022-04-15 17:49:53,254 INFO L479 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-15 17:49:53,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 504 states and 717 transitions. [2022-04-15 17:49:54,634 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-15 17:49:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 717 transitions. [2022-04-15 17:49:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 17:49:54,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:54,635 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:49:54,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 17:49:54,636 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 1 times [2022-04-15 17:49:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:54,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018252139] [2022-04-15 17:49:54,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1175453866, now seen corresponding path program 2 times [2022-04-15 17:49:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:54,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935281344] [2022-04-15 17:49:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:54,706 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-15 17:49:54,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-15 17:49:54,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-15 17:49:54,707 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-15 17:49:54,707 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-15 17:49:54,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {56636#true} assume true; {56636#true} is VALID [2022-04-15 17:49:54,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56636#true} {56636#true} #752#return; {56636#true} is VALID [2022-04-15 17:49:54,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {56636#true} call #t~ret59 := main(); {56636#true} is VALID [2022-04-15 17:49:54,711 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-15 17:49:54,711 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-15 17:49:54,713 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:54,713 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-15 17:49:54,713 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-15 17:49:54,714 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-15 17:49:54,714 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-15 17:49:54,714 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-15 17:49:54,715 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-15 17:49:54,715 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-15 17:49:54,715 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-15 17:49:54,716 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-15 17:49:54,716 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-15 17:49:54,716 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-15 17:49:54,717 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-15 17:49:54,717 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-15 17:49:54,717 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-15 17:49:54,718 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-15 17:49:54,718 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-15 17:49:54,718 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-15 17:49:54,718 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-15 17:49:54,719 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-15 17:49:54,719 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-15 17:49:54,719 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-15 17:49:54,720 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-15 17:49:54,720 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-15 17:49:54,720 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-15 17:49:54,721 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-15 17:49:54,721 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-15 17:49:54,721 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-15 17:49:54,722 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-15 17:49:54,722 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-15 17:49:54,722 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-15 17:49:54,723 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-15 17:49:54,723 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-15 17:49:54,723 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-15 17:49:54,724 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-15 17:49:54,724 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-15 17:49:54,724 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-15 17:49:54,724 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-15 17:49:54,725 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-15 17:49:54,725 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-15 17:49:54,725 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-15 17:49:54,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {56637#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {56637#false} is VALID [2022-04-15 17:49:54,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {56637#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {56637#false} is VALID [2022-04-15 17:49:54,726 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-15 17:49:54,726 INFO L290 TraceCheckUtils]: 51: Hoare triple {56637#false} ~s__init_num~0 := 0; {56637#false} is VALID [2022-04-15 17:49:54,726 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-15 17:49:54,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {56637#false} assume 0 == ~s__s3__tmp__reuse_message~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {56637#false} assume 0 == ~skip~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 55: Hoare triple {56637#false} assume 8560 == ~state~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {56637#false} assume 8448 == ~s__state~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {56637#false} assume -1 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {56637#false} assume -2 != ~s__verify_mode~0; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 59: Hoare triple {56637#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {56637#false} is VALID [2022-04-15 17:49:54,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {56637#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {56637#false} is VALID [2022-04-15 17:49:54,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {56637#false} assume 4 != ~blastFlag~0; {56637#false} is VALID [2022-04-15 17:49:54,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {56637#false} assume 1024 != ~tmp___7~0; {56637#false} is VALID [2022-04-15 17:49:54,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {56637#false} assume !false; {56637#false} is VALID [2022-04-15 17:49:54,732 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-15 17:49:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:54,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935281344] [2022-04-15 17:49:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935281344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:54,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:54,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018252139] [2022-04-15 17:49:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018252139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:54,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020824185] [2022-04-15 17:49:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:54,734 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-15 17:49:54,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:54,734 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-15 17:49:54,776 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-15 17:49:54,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:54,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:54,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:54,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:54,777 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-15 17:49:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:55,675 INFO L93 Difference]: Finished difference Result 1045 states and 1487 transitions. [2022-04-15 17:49:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:55,675 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-15 17:49:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:55,675 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-15 17:49:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 17:49:55,677 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-15 17:49:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2022-04-15 17:49:55,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 569 transitions. [2022-04-15 17:49:56,044 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-15 17:49:56,056 INFO L225 Difference]: With dead ends: 1045 [2022-04-15 17:49:56,056 INFO L226 Difference]: Without dead ends: 555 [2022-04-15 17:49:56,057 INFO L912 BasicCegarLoop]: 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-15 17:49:56,057 INFO L913 BasicCegarLoop]: 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-15 17:49:56,057 INFO L914 BasicCegarLoop]: 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-15 17:49:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-15 17:49:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 549. [2022-04-15 17:49:56,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:56,163 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-15 17:49:56,164 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-15 17:49:56,164 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-15 17:49:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:56,178 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-15 17:49:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-15 17:49:56,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:56,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:56,179 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-15 17:49:56,180 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-15 17:49:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:56,194 INFO L93 Difference]: Finished difference Result 555 states and 787 transitions. [2022-04-15 17:49:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 787 transitions. [2022-04-15 17:49:56,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:56,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:56,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:56,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:56,196 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-15 17:49:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 777 transitions. [2022-04-15 17:49:56,215 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 777 transitions. Word has length 64 [2022-04-15 17:49:56,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:56,215 INFO L478 AbstractCegarLoop]: Abstraction has 549 states and 777 transitions. [2022-04-15 17:49:56,215 INFO L479 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-15 17:49:56,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 549 states and 777 transitions. [2022-04-15 17:49:57,591 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-15 17:49:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 777 transitions. [2022-04-15 17:49:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 17:49:57,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:57,592 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:49:57,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 17:49:57,592 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 1 times [2022-04-15 17:49:57,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:57,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443593600] [2022-04-15 17:49:57,592 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1954305357, now seen corresponding path program 2 times [2022-04-15 17:49:57,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:57,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001982234] [2022-04-15 17:49:57,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:57,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:57,660 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-15 17:49:57,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-15 17:49:57,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-15 17:49:57,661 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-15 17:49:57,661 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-15 17:49:57,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {60951#true} assume true; {60951#true} is VALID [2022-04-15 17:49:57,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60951#true} {60951#true} #752#return; {60951#true} is VALID [2022-04-15 17:49:57,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {60951#true} call #t~ret59 := main(); {60951#true} is VALID [2022-04-15 17:49:57,662 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-15 17:49:57,662 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-15 17:49:57,664 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 -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~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 -9223372036854775808 <= #t~nondet26 && #t~nondet26 <= 9223372036854775807;~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-15 17:49:57,665 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-15 17:49:57,665 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-15 17:49:57,665 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-15 17:49:57,666 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-15 17:49:57,666 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-15 17:49:57,667 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-15 17:49:57,667 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-15 17:49:57,667 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-15 17:49:57,668 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-15 17:49:57,668 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-15 17:49:57,669 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-15 17:49:57,669 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-15 17:49:57,670 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-15 17:49:57,670 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-15 17:49:57,670 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-15 17:49:57,671 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-15 17:49:57,671 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-15 17:49:57,672 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-15 17:49:57,672 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-15 17:49:57,673 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-15 17:49:57,673 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-15 17:49:57,673 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-15 17:49:57,674 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-15 17:49:57,674 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-15 17:49:57,675 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-15 17:49:57,675 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-15 17:49:57,675 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-15 17:49:57,676 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-15 17:49:57,676 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-15 17:49:57,677 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-15 17:49:57,677 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-15 17:49:57,677 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-15 17:49:57,678 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-15 17:49:57,678 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-15 17:49:57,679 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-15 17:49:57,679 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-15 17:49:57,679 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-15 17:49:57,680 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-15 17:49:57,680 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-15 17:49:57,681 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-15 17:49:57,681 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-15 17:49:57,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {60952#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {60952#false} is VALID [2022-04-15 17:49:57,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {60952#false} assume !(~ret~0 <= 0);~s__state~0 := 8448; {60952#false} is VALID [2022-04-15 17:49:57,681 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-15 17:49:57,681 INFO L290 TraceCheckUtils]: 52: Hoare triple {60952#false} ~s__init_num~0 := 0; {60952#false} is VALID [2022-04-15 17:49:57,681 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-15 17:49:57,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {60952#false} assume 0 == ~s__s3__tmp__reuse_message~0; {60952#false} is VALID [2022-04-15 17:49:57,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {60952#false} assume 0 == ~skip~0; {60952#false} is VALID [2022-04-15 17:49:57,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {60952#false} assume 8560 == ~state~0; {60952#false} is VALID [2022-04-15 17:49:57,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {60952#false} assume 8448 == ~s__state~0; {60952#false} is VALID [2022-04-15 17:49:57,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {60952#false} assume -1 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 59: Hoare triple {60952#false} assume -2 != ~s__verify_mode~0; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {60952#false} assume 9021 != ~__cil_tmp61~0 % 18446744073709551616; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {60952#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {60952#false} assume 4 != ~blastFlag~0; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 63: Hoare triple {60952#false} assume 1024 != ~tmp___7~0; {60952#false} is VALID [2022-04-15 17:49:57,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {60952#false} assume !false; {60952#false} is VALID [2022-04-15 17:49:57,682 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-15 17:49:57,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:57,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001982234] [2022-04-15 17:49:57,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001982234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:57,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:57,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:57,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:57,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443593600] [2022-04-15 17:49:57,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443593600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:57,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:57,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736875230] [2022-04-15 17:49:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:57,684 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-15 17:49:57,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:57,684 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-15 17:49:57,736 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-15 17:49:57,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:57,737 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-15 17:49:58,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:58,775 INFO L93 Difference]: Finished difference Result 1094 states and 1553 transitions. [2022-04-15 17:49:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:58,775 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-15 17:49:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:58,775 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-15 17:49:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-15 17:49:58,777 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-15 17:49:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions. [2022-04-15 17:49:58,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 570 transitions. [2022-04-15 17:49:59,148 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-15 17:49:59,160 INFO L225 Difference]: With dead ends: 1094 [2022-04-15 17:49:59,160 INFO L226 Difference]: Without dead ends: 557 [2022-04-15 17:49:59,161 INFO L912 BasicCegarLoop]: 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-15 17:49:59,161 INFO L913 BasicCegarLoop]: 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-15 17:49:59,161 INFO L914 BasicCegarLoop]: 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-15 17:49:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-15 17:49:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 551. [2022-04-15 17:49:59,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:59,276 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-15 17:49:59,276 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-15 17:49:59,277 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-15 17:49:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:59,290 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-15 17:49:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-15 17:49:59,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:59,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:59,291 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-15 17:49:59,292 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-15 17:49:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:59,306 INFO L93 Difference]: Finished difference Result 557 states and 790 transitions. [2022-04-15 17:49:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2022-04-15 17:49:59,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:59,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:59,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:59,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:59,308 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-15 17:49:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 780 transitions. [2022-04-15 17:49:59,332 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 780 transitions. Word has length 65 [2022-04-15 17:49:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:59,332 INFO L478 AbstractCegarLoop]: Abstraction has 551 states and 780 transitions. [2022-04-15 17:49:59,333 INFO L479 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-15 17:49:59,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 551 states and 780 transitions. [2022-04-15 17:50:00,741 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-15 17:50:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 780 transitions. [2022-04-15 17:50:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 17:50:00,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:00,742 INFO L499 BasicCegarLoop]: 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-15 17:50:00,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 17:50:00,743 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1606826053, now seen corresponding path program 1 times [2022-04-15 17:50:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:00,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655625909]