/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:16:08,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:16:08,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:16:08,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:16:08,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:16:08,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:16:08,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:16:08,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:16:08,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:16:08,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:16:08,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:16:08,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:16:08,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:16:08,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:16:08,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:16:08,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:16:08,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:16:08,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:16:08,868 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:16:08,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:16:08,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:16:08,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:16:08,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:16:08,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:16:08,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:16:08,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:16:08,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:16:08,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:16:08,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:16:08,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:16:08,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:16:08,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:16:08,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:16:08,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:16:08,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:16:08,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:16:08,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:16:08,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:16:08,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:16:08,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:16:08,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:16:08,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:16:08,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:16:08,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:16:08,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:16:08,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:16:08,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:16:08,908 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:16:08,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:16:08,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:16:08,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:16:08,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:16:08,910 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:16:08,910 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:16:08,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:16:08,910 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:16:08,910 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-08 08:16:09,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:16:09,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:16:09,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:16:09,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:16:09,142 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:16:09,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c [2022-04-08 08:16:09,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/186b0075a/d4e3f06ec3934499b88080ce65a49fe3/FLAG2bf54151e [2022-04-08 08:16:09,566 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:16:09,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_11.cil.c [2022-04-08 08:16:09,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/186b0075a/d4e3f06ec3934499b88080ce65a49fe3/FLAG2bf54151e [2022-04-08 08:16:09,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/186b0075a/d4e3f06ec3934499b88080ce65a49fe3 [2022-04-08 08:16:09,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:16:09,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:16:09,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:16:09,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:16:09,983 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:16:09,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:16:09" (1/1) ... [2022-04-08 08:16:09,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3146cb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:09, skipping insertion in model container [2022-04-08 08:16:09,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:16:09" (1/1) ... [2022-04-08 08:16:09,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:16:10,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:16:10,308 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_11.cil.c[43646,43659] [2022-04-08 08:16:10,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:16:10,322 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:16:10,365 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_11.cil.c[43646,43659] [2022-04-08 08:16:10,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:16:10,378 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:16:10,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10 WrapperNode [2022-04-08 08:16:10,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:16:10,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:16:10,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:16:10,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:16:10,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:16:10,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:16:10,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:16:10,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:16:10,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (1/1) ... [2022-04-08 08:16:10,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:16:10,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:16:10,514 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-08 08:16:10,521 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-08 08:16:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:16:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:16:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:16:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 08:16:10,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:16:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 08:16:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:16:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:16:10,653 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:16:10,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:16:10,734 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:16:11,160 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-08 08:16:11,160 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-08 08:16:11,166 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:16:11,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:16:11,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:16:11,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:16:11 BoogieIcfgContainer [2022-04-08 08:16:11,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:16:11,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:16:11,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:16:11,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:16:11,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:16:09" (1/3) ... [2022-04-08 08:16:11,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4958b202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:16:11, skipping insertion in model container [2022-04-08 08:16:11,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:16:10" (2/3) ... [2022-04-08 08:16:11,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4958b202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:16:11, skipping insertion in model container [2022-04-08 08:16:11,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:16:11" (3/3) ... [2022-04-08 08:16:11,182 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2022-04-08 08:16:11,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:16:11,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:16:11,220 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:16:11,226 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-08 08:16:11,227 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:16:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7266666666666666) internal successors, (259), 151 states have internal predecessors, (259), 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-08 08:16:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 08:16:11,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:11,255 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] [2022-04-08 08:16:11,255 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1730008188, now seen corresponding path program 1 times [2022-04-08 08:16:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:11,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451367322] [2022-04-08 08:16:11,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1730008188, now seen corresponding path program 2 times [2022-04-08 08:16:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:11,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664808357] [2022-04-08 08:16:11,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:11,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(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); {161#true} is VALID [2022-04-08 08:16:11,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:16:11,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #657#return; {161#true} is VALID [2022-04-08 08:16:11,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:11,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(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); {161#true} is VALID [2022-04-08 08:16:11,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 08:16:11,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #657#return; {161#true} is VALID [2022-04-08 08:16:11,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret60 := main(); {161#true} is VALID [2022-04-08 08:16:11,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {161#true} is VALID [2022-04-08 08:16:11,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {161#true} call #t~ret59 := ssl3_accept(~s~0); {161#true} is VALID [2022-04-08 08:16:11,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {161#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {161#true} is VALID [2022-04-08 08:16:11,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {161#true} is VALID [2022-04-08 08:16:11,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {161#true} is VALID [2022-04-08 08:16:11,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#true} assume !(0 != 12288 + ~tmp___1~0); {161#true} is VALID [2022-04-08 08:16:11,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#true} assume !(0 == ~s__cert~0); {161#true} is VALID [2022-04-08 08:16:11,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#true} assume !false; {161#true} is VALID [2022-04-08 08:16:11,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#true} ~state~0 := ~s__state~0; {161#true} is VALID [2022-04-08 08:16:11,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#true} assume !(12292 == ~s__state~0); {161#true} is VALID [2022-04-08 08:16:11,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#true} assume !(16384 == ~s__state~0); {161#true} is VALID [2022-04-08 08:16:11,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#true} assume !(8192 == ~s__state~0); {161#true} is VALID [2022-04-08 08:16:11,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#true} assume !(24576 == ~s__state~0); {161#true} is VALID [2022-04-08 08:16:11,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#true} assume !(8195 == ~s__state~0); {161#true} is VALID [2022-04-08 08:16:11,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#true} assume 8480 == ~s__state~0; {161#true} is VALID [2022-04-08 08:16:11,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#true} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {161#true} is VALID [2022-04-08 08:16:11,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#true} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-08 08:16:11,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume !(0 == ~s__s3__tmp__reuse_message~0); {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-08 08:16:11,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume 8576 == ~state~0; {166#(<= ssl3_accept_~s__state~0 8448)} is VALID [2022-04-08 08:16:11,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(<= ssl3_accept_~s__state~0 8448)} assume 8592 == ~s__state~0; {162#false} is VALID [2022-04-08 08:16:11,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {162#false} assume -12288 != ~tmp___1~0; {162#false} is VALID [2022-04-08 08:16:11,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {162#false} assume -16384 != ~tmp___2~0; {162#false} is VALID [2022-04-08 08:16:11,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {162#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {162#false} is VALID [2022-04-08 08:16:11,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {162#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {162#false} is VALID [2022-04-08 08:16:11,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {162#false} assume 1024 != ~tmp___7~0; {162#false} is VALID [2022-04-08 08:16:11,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {162#false} assume 512 != ~tmp___7~0; {162#false} is VALID [2022-04-08 08:16:11,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 08:16:11,617 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-08 08:16:11,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:11,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664808357] [2022-04-08 08:16:11,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664808357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:11,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:11,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:11,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:11,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451367322] [2022-04-08 08:16:11,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451367322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:11,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:11,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223283247] [2022-04-08 08:16:11,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 32 [2022-04-08 08:16:11,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:11,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-08 08:16:11,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:11,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:11,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:11,699 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7266666666666666) internal successors, (259), 151 states have internal predecessors, (259), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-08 08:16:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:12,697 INFO L93 Difference]: Finished difference Result 365 states and 628 transitions. [2022-04-08 08:16:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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 32 [2022-04-08 08:16:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-08 08:16:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-04-08 08:16:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-08 08:16:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2022-04-08 08:16:12,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 628 transitions. [2022-04-08 08:16:13,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:13,235 INFO L225 Difference]: With dead ends: 365 [2022-04-08 08:16:13,236 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 08:16:13,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:13,241 INFO L913 BasicCegarLoop]: 281 mSDtfsCounter, 355 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:13,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 290 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:16:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 08:16:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2022-04-08 08:16:13,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:13,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:13,340 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:13,340 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:13,352 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-08 08:16:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-08 08:16:13,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:13,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:13,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 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 186 states. [2022-04-08 08:16:13,361 INFO L87 Difference]: Start difference. First operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 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 186 states. [2022-04-08 08:16:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:13,370 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2022-04-08 08:16:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2022-04-08 08:16:13,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:13,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:13,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:13,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 271 transitions. [2022-04-08 08:16:13,384 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 271 transitions. Word has length 32 [2022-04-08 08:16:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:13,385 INFO L478 AbstractCegarLoop]: Abstraction has 185 states and 271 transitions. [2022-04-08 08:16:13,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 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-08 08:16:13,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 185 states and 271 transitions. [2022-04-08 08:16:13,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 271 transitions. [2022-04-08 08:16:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 08:16:13,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:13,595 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] [2022-04-08 08:16:13,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:16:13,595 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1886345113, now seen corresponding path program 1 times [2022-04-08 08:16:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:13,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963598460] [2022-04-08 08:16:13,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1886345113, now seen corresponding path program 2 times [2022-04-08 08:16:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:13,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808357373] [2022-04-08 08:16:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:13,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:13,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {1652#(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); {1645#true} is VALID [2022-04-08 08:16:13,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-04-08 08:16:13,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #657#return; {1645#true} is VALID [2022-04-08 08:16:13,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1652#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:13,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#(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); {1645#true} is VALID [2022-04-08 08:16:13,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1645#true} assume true; {1645#true} is VALID [2022-04-08 08:16:13,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1645#true} {1645#true} #657#return; {1645#true} is VALID [2022-04-08 08:16:13,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {1645#true} call #t~ret60 := main(); {1645#true} is VALID [2022-04-08 08:16:13,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1645#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1645#true} is VALID [2022-04-08 08:16:13,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {1645#true} call #t~ret59 := ssl3_accept(~s~0); {1645#true} is VALID [2022-04-08 08:16:13,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {1645#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {1645#true} is VALID [2022-04-08 08:16:13,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1645#true} is VALID [2022-04-08 08:16:13,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1645#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {1645#true} is VALID [2022-04-08 08:16:13,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {1645#true} assume !(0 != 12288 + ~tmp___1~0); {1645#true} is VALID [2022-04-08 08:16:13,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {1645#true} assume !(0 == ~s__cert~0); {1645#true} is VALID [2022-04-08 08:16:13,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#true} assume !false; {1645#true} is VALID [2022-04-08 08:16:13,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#true} ~state~0 := ~s__state~0; {1650#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {1650#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} assume 12292 == ~s__state~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~s__new_session~0 := 1; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~s__server~0 := 1; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume 0 != ~cb~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} ~__cil_tmp55~0 := 8 * ~s__version~0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__init_buf___0~0); {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(12292 != ~s__state~0);#t~post36 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post36;havoc #t~post36;~s__state~0 := 8480; {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {1651#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-08 08:16:13,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {1651#(<= 12292 ssl3_accept_~state~0)} assume 8576 == ~state~0; {1646#false} is VALID [2022-04-08 08:16:13,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {1646#false} assume 8592 == ~s__state~0; {1646#false} is VALID [2022-04-08 08:16:13,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {1646#false} assume -12288 != ~tmp___1~0; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {1646#false} assume -16384 != ~tmp___2~0; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {1646#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 29: Hoare triple {1646#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 30: Hoare triple {1646#false} assume 1024 != ~tmp___7~0; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#false} assume 512 != ~tmp___7~0; {1646#false} is VALID [2022-04-08 08:16:13,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2022-04-08 08:16:13,737 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-08 08:16:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808357373] [2022-04-08 08:16:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808357373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:13,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963598460] [2022-04-08 08:16:13,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963598460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:13,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:13,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734060132] [2022-04-08 08:16:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 33 [2022-04-08 08:16:13,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:13,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-08 08:16:13,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:13,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:16:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:13,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:16:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:13,766 INFO L87 Difference]: Start difference. First operand 185 states and 271 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-08 08:16:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:14,730 INFO L93 Difference]: Finished difference Result 385 states and 567 transitions. [2022-04-08 08:16:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:16:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 33 [2022-04-08 08:16:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-08 08:16:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 08:16:14,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-08 08:16:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 08:16:14,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 08:16:15,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:15,111 INFO L225 Difference]: With dead ends: 385 [2022-04-08 08:16:15,111 INFO L226 Difference]: Without dead ends: 214 [2022-04-08 08:16:15,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:16:15,113 INFO L913 BasicCegarLoop]: 173 mSDtfsCounter, 423 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:15,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 185 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:16:15,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-04-08 08:16:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2022-04-08 08:16:15,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:15,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:15,237 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:15,238 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:15,244 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2022-04-08 08:16:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-08 08:16:15,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:15,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:15,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 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 214 states. [2022-04-08 08:16:15,246 INFO L87 Difference]: Start difference. First operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 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 214 states. [2022-04-08 08:16:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:15,252 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2022-04-08 08:16:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2022-04-08 08:16:15,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:15,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:15,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:15,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 284 transitions. [2022-04-08 08:16:15,259 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 284 transitions. Word has length 33 [2022-04-08 08:16:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:15,260 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 284 transitions. [2022-04-08 08:16:15,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-08 08:16:15,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 284 transitions. [2022-04-08 08:16:15,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 284 transitions. [2022-04-08 08:16:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 08:16:15,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:15,524 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-08 08:16:15,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:16:15,525 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:15,525 INFO L85 PathProgramCache]: Analyzing trace with hash -818420097, now seen corresponding path program 1 times [2022-04-08 08:16:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:15,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1498272851] [2022-04-08 08:16:15,526 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash -818420097, now seen corresponding path program 2 times [2022-04-08 08:16:15,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:15,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298942681] [2022-04-08 08:16:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:15,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {3252#(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); {3245#true} is VALID [2022-04-08 08:16:15,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-08 08:16:15,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3245#true} {3245#true} #657#return; {3245#true} is VALID [2022-04-08 08:16:15,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {3245#true} call ULTIMATE.init(); {3252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:15,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {3252#(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); {3245#true} is VALID [2022-04-08 08:16:15,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-04-08 08:16:15,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3245#true} {3245#true} #657#return; {3245#true} is VALID [2022-04-08 08:16:15,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {3245#true} call #t~ret60 := main(); {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {3245#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {3245#true} call #t~ret59 := ssl3_accept(~s~0); {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {3245#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {3245#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {3245#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {3245#true} is VALID [2022-04-08 08:16:15,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {3245#true} assume !(0 != 12288 + ~tmp___1~0); {3245#true} is VALID [2022-04-08 08:16:15,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {3245#true} assume !(0 == ~s__cert~0); {3245#true} is VALID [2022-04-08 08:16:15,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#true} assume !false; {3245#true} is VALID [2022-04-08 08:16:15,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#true} ~state~0 := ~s__state~0; {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:15,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:15,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:15,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {3250#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8192 == ~s__state~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} ~s__server~0 := 1; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 0 != ~cb~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} ~__cil_tmp55~0 := 8 * ~s__version~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~s__init_buf___0~0); {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 12292 != ~s__state~0; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~tmp___5~0);~s__state~0 := 8464;#t~post35 := ~s__ctx__stats__sess_accept~0;~s__ctx__stats__sess_accept~0 := 1 + #t~post35;havoc #t~post35; {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume !(0 == ~s__s3__tmp__reuse_message~0); {3251#(<= ssl3_accept_~state~0 8192)} is VALID [2022-04-08 08:16:15,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {3251#(<= ssl3_accept_~state~0 8192)} assume 8576 == ~state~0; {3246#false} is VALID [2022-04-08 08:16:15,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {3246#false} assume 8592 == ~s__state~0; {3246#false} is VALID [2022-04-08 08:16:15,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {3246#false} assume -12288 != ~tmp___1~0; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {3246#false} assume -16384 != ~tmp___2~0; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {3246#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {3246#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {3246#false} assume 1024 != ~tmp___7~0; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {3246#false} assume 512 != ~tmp___7~0; {3246#false} is VALID [2022-04-08 08:16:15,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {3246#false} assume !false; {3246#false} is VALID [2022-04-08 08:16:15,626 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-08 08:16:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:15,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298942681] [2022-04-08 08:16:15,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298942681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:15,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:15,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:15,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:15,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1498272851] [2022-04-08 08:16:15,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1498272851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:15,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:15,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86576208] [2022-04-08 08:16:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-08 08:16:15,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:15,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-08 08:16:15,650 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-08 08:16:15,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:16:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:15,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:16:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:15,652 INFO L87 Difference]: Start difference. First operand 193 states and 284 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-08 08:16:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:16,667 INFO L93 Difference]: Finished difference Result 411 states and 605 transitions. [2022-04-08 08:16:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:16:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 35 [2022-04-08 08:16:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-08 08:16:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 08:16:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-08 08:16:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 08:16:16,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 08:16:17,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:17,036 INFO L225 Difference]: With dead ends: 411 [2022-04-08 08:16:17,036 INFO L226 Difference]: Without dead ends: 232 [2022-04-08 08:16:17,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 08:16:17,037 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 396 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:17,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 196 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:16:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-08 08:16:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2022-04-08 08:16:17,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:17,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:17,300 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:17,301 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:17,307 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2022-04-08 08:16:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2022-04-08 08:16:17,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:17,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:17,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 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 232 states. [2022-04-08 08:16:17,309 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 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 232 states. [2022-04-08 08:16:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:17,315 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2022-04-08 08:16:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 338 transitions. [2022-04-08 08:16:17,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:17,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:17,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:17,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.4771573604060915) internal successors, (291), 197 states have internal predecessors, (291), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2022-04-08 08:16:17,323 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 35 [2022-04-08 08:16:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:17,323 INFO L478 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2022-04-08 08:16:17,323 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-08 08:16:17,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 202 states and 295 transitions. [2022-04-08 08:16:17,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2022-04-08 08:16:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 08:16:17,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:17,597 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-08 08:16:17,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:16:17,598 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -148338235, now seen corresponding path program 1 times [2022-04-08 08:16:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399607421] [2022-04-08 08:16:17,599 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash -148338235, now seen corresponding path program 2 times [2022-04-08 08:16:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:17,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883345783] [2022-04-08 08:16:17,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:17,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {4957#(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); {4951#true} is VALID [2022-04-08 08:16:17,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {4951#true} assume true; {4951#true} is VALID [2022-04-08 08:16:17,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4951#true} {4951#true} #657#return; {4951#true} is VALID [2022-04-08 08:16:17,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {4951#true} call ULTIMATE.init(); {4957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:17,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {4957#(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); {4951#true} is VALID [2022-04-08 08:16:17,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {4951#true} assume true; {4951#true} is VALID [2022-04-08 08:16:17,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4951#true} {4951#true} #657#return; {4951#true} is VALID [2022-04-08 08:16:17,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {4951#true} call #t~ret60 := main(); {4951#true} is VALID [2022-04-08 08:16:17,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {4951#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4951#true} is VALID [2022-04-08 08:16:17,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {4951#true} call #t~ret59 := ssl3_accept(~s~0); {4951#true} is VALID [2022-04-08 08:16:17,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {4951#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4951#true} is VALID [2022-04-08 08:16:17,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {4951#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4951#true} is VALID [2022-04-08 08:16:17,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {4951#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {4951#true} is VALID [2022-04-08 08:16:17,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {4951#true} assume !(0 != 12288 + ~tmp___1~0); {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {4951#true} assume !(0 == ~s__cert~0); {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {4951#true} assume !false; {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {4951#true} ~state~0 := ~s__state~0; {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#true} assume !(12292 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#true} assume !(16384 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {4951#true} assume !(8192 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {4951#true} assume !(24576 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {4951#true} assume !(8195 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {4951#true} assume !(8480 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {4951#true} assume !(8481 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {4951#true} assume !(8482 == ~s__state~0); {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {4951#true} assume 8464 == ~s__state~0; {4951#true} is VALID [2022-04-08 08:16:17,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {4951#true} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~ret~0 := #t~nondet38;havoc #t~nondet38; {4951#true} is VALID [2022-04-08 08:16:17,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {4951#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4951#true} is VALID [2022-04-08 08:16:17,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {4951#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;~s__state~0 := 8496;~s__init_num~0 := 0; {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-08 08:16:17,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume !(0 == ~s__s3__tmp__reuse_message~0); {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-08 08:16:17,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume 8576 == ~state~0; {4956#(<= ssl3_accept_~s__state~0 8496)} is VALID [2022-04-08 08:16:17,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {4956#(<= ssl3_accept_~s__state~0 8496)} assume 8592 == ~s__state~0; {4952#false} is VALID [2022-04-08 08:16:17,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {4952#false} assume -12288 != ~tmp___1~0; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {4952#false} assume -16384 != ~tmp___2~0; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {4952#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {4952#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {4952#false} assume 1024 != ~tmp___7~0; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {4952#false} assume 512 != ~tmp___7~0; {4952#false} is VALID [2022-04-08 08:16:17,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {4952#false} assume !false; {4952#false} is VALID [2022-04-08 08:16:17,668 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-08 08:16:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:17,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883345783] [2022-04-08 08:16:17,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883345783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:17,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:17,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:17,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:17,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399607421] [2022-04-08 08:16:17,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399607421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:17,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:17,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006941143] [2022-04-08 08:16:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:17,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 36 [2022-04-08 08:16:17,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:17,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-08 08:16:17,692 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-08 08:16:17,692 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:17,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:17,693 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-08 08:16:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:18,599 INFO L93 Difference]: Finished difference Result 441 states and 666 transitions. [2022-04-08 08:16:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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 36 [2022-04-08 08:16:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-08 08:16:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-04-08 08:16:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-08 08:16:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2022-04-08 08:16:18,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 524 transitions. [2022-04-08 08:16:18,967 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-08 08:16:18,972 INFO L225 Difference]: With dead ends: 441 [2022-04-08 08:16:18,972 INFO L226 Difference]: Without dead ends: 241 [2022-04-08 08:16:18,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:18,973 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 310 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:18,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 234 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:16:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-08 08:16:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2022-04-08 08:16:19,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:19,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:19,302 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:19,303 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:19,309 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2022-04-08 08:16:19,309 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 352 transitions. [2022-04-08 08:16:19,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:19,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:19,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 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 241 states. [2022-04-08 08:16:19,311 INFO L87 Difference]: Start difference. First operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 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 241 states. [2022-04-08 08:16:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:19,315 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2022-04-08 08:16:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 352 transitions. [2022-04-08 08:16:19,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:19,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:19,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:19,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.4954545454545454) internal successors, (329), 220 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 333 transitions. [2022-04-08 08:16:19,322 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 333 transitions. Word has length 36 [2022-04-08 08:16:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:19,322 INFO L478 AbstractCegarLoop]: Abstraction has 225 states and 333 transitions. [2022-04-08 08:16:19,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-08 08:16:19,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 225 states and 333 transitions. [2022-04-08 08:16:19,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 333 transitions. [2022-04-08 08:16:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 08:16:19,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:19,600 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] [2022-04-08 08:16:19,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:16:19,600 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1107449201, now seen corresponding path program 1 times [2022-04-08 08:16:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393534371] [2022-04-08 08:16:19,601 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1107449201, now seen corresponding path program 2 times [2022-04-08 08:16:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142694867] [2022-04-08 08:16:19,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:19,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {6783#(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); {6777#true} is VALID [2022-04-08 08:16:19,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {6777#true} assume true; {6777#true} is VALID [2022-04-08 08:16:19,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6777#true} {6777#true} #657#return; {6777#true} is VALID [2022-04-08 08:16:19,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {6777#true} call ULTIMATE.init(); {6783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:19,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#(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); {6777#true} is VALID [2022-04-08 08:16:19,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {6777#true} assume true; {6777#true} is VALID [2022-04-08 08:16:19,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6777#true} {6777#true} #657#return; {6777#true} is VALID [2022-04-08 08:16:19,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {6777#true} call #t~ret60 := main(); {6777#true} is VALID [2022-04-08 08:16:19,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {6777#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {6777#true} is VALID [2022-04-08 08:16:19,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {6777#true} call #t~ret59 := ssl3_accept(~s~0); {6777#true} is VALID [2022-04-08 08:16:19,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {6777#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != 12288 + ~tmp___1~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~s__cert~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !false; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} ~state~0 := ~s__state~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == ~s__state~0); {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 8496 == ~s__state~0; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {6782#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 08:16:19,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {6782#(= ssl3_accept_~blastFlag~0 0)} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {6778#false} is VALID [2022-04-08 08:16:19,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {6778#false} assume !(~ret~0 <= 0); {6778#false} is VALID [2022-04-08 08:16:19,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {6778#false} assume 0 != ~s__hit~0;~s__state~0 := 8656; {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {6778#false} ~s__init_num~0 := 0; {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {6778#false} assume !(0 == ~s__s3__tmp__reuse_message~0); {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {6778#false} assume 8576 == ~state~0; {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {6778#false} assume 8592 == ~s__state~0; {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {6778#false} assume -12288 != ~tmp___1~0; {6778#false} is VALID [2022-04-08 08:16:19,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {6778#false} assume -16384 != ~tmp___2~0; {6778#false} is VALID [2022-04-08 08:16:19,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {6778#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {6778#false} is VALID [2022-04-08 08:16:19,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {6778#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {6778#false} is VALID [2022-04-08 08:16:19,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {6778#false} assume 1024 != ~tmp___7~0; {6778#false} is VALID [2022-04-08 08:16:19,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {6778#false} assume 512 != ~tmp___7~0; {6778#false} is VALID [2022-04-08 08:16:19,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {6778#false} assume !false; {6778#false} is VALID [2022-04-08 08:16:19,692 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-08 08:16:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:19,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142694867] [2022-04-08 08:16:19,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142694867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:19,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:19,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:19,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:19,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393534371] [2022-04-08 08:16:19,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393534371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:19,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:19,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587311891] [2022-04-08 08:16:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2022-04-08 08:16:19,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:19,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:19,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:19,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:19,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:19,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:19,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:19,724 INFO L87 Difference]: Start difference. First operand 225 states and 333 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:20,875 INFO L93 Difference]: Finished difference Result 646 states and 962 transitions. [2022-04-08 08:16:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2022-04-08 08:16:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-08 08:16:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-08 08:16:20,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 617 transitions. [2022-04-08 08:16:21,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:21,351 INFO L225 Difference]: With dead ends: 646 [2022-04-08 08:16:21,351 INFO L226 Difference]: Without dead ends: 435 [2022-04-08 08:16:21,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:21,352 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:21,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [589 Valid, 220 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:16:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-04-08 08:16:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2022-04-08 08:16:21,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:21,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:21,878 INFO L74 IsIncluded]: Start isIncluded. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:21,879 INFO L87 Difference]: Start difference. First operand 435 states. Second operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:21,891 INFO L93 Difference]: Finished difference Result 435 states and 642 transitions. [2022-04-08 08:16:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 642 transitions. [2022-04-08 08:16:21,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:21,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:21,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 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 435 states. [2022-04-08 08:16:21,894 INFO L87 Difference]: Start difference. First operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 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 435 states. [2022-04-08 08:16:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:21,906 INFO L93 Difference]: Finished difference Result 435 states and 642 transitions. [2022-04-08 08:16:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 642 transitions. [2022-04-08 08:16:21,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:21,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:21,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:21,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 428 states have (on average 1.4883177570093458) internal successors, (637), 428 states have internal predecessors, (637), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 641 transitions. [2022-04-08 08:16:21,922 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 641 transitions. Word has length 41 [2022-04-08 08:16:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:21,922 INFO L478 AbstractCegarLoop]: Abstraction has 433 states and 641 transitions. [2022-04-08 08:16:21,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:21,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 433 states and 641 transitions. [2022-04-08 08:16:22,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 641 transitions. [2022-04-08 08:16:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 08:16:22,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:22,537 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] [2022-04-08 08:16:22,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:16:22,537 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1540817245, now seen corresponding path program 1 times [2022-04-08 08:16:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:22,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [517045894] [2022-04-08 08:16:22,538 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:22,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1540817245, now seen corresponding path program 2 times [2022-04-08 08:16:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:22,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63832250] [2022-04-08 08:16:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:22,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {9822#(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); {9816#true} is VALID [2022-04-08 08:16:22,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {9816#true} assume true; {9816#true} is VALID [2022-04-08 08:16:22,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9816#true} {9816#true} #657#return; {9816#true} is VALID [2022-04-08 08:16:22,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {9816#true} call ULTIMATE.init(); {9822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:22,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {9822#(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); {9816#true} is VALID [2022-04-08 08:16:22,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {9816#true} assume true; {9816#true} is VALID [2022-04-08 08:16:22,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9816#true} {9816#true} #657#return; {9816#true} is VALID [2022-04-08 08:16:22,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {9816#true} call #t~ret60 := main(); {9816#true} is VALID [2022-04-08 08:16:22,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {9816#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {9816#true} call #t~ret59 := ssl3_accept(~s~0); {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {9816#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {9816#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {9816#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#true} assume !(0 != 12288 + ~tmp___1~0); {9816#true} is VALID [2022-04-08 08:16:22,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {9816#true} assume !(0 == ~s__cert~0); {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {9816#true} assume !false; {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {9816#true} ~state~0 := ~s__state~0; {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {9816#true} assume !(12292 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {9816#true} assume !(16384 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {9816#true} assume !(8192 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {9816#true} assume !(24576 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {9816#true} assume !(8195 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {9816#true} assume !(8480 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {9816#true} assume !(8481 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {9816#true} assume !(8482 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {9816#true} assume !(8464 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {9816#true} assume !(8465 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {9816#true} assume !(8466 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {9816#true} assume !(8496 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {9816#true} assume !(8497 == ~s__state~0); {9816#true} is VALID [2022-04-08 08:16:22,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {9816#true} assume 8512 == ~s__state~0; {9816#true} is VALID [2022-04-08 08:16:22,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {9816#true} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {9816#true} is VALID [2022-04-08 08:16:22,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {9816#true} assume 0 != (256 + ~__cil_tmp56~0) % 4294967296;~skip~0 := 1; {9816#true} is VALID [2022-04-08 08:16:22,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {9816#true} ~s__state~0 := 8528;~s__init_num~0 := 0; {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-08 08:16:22,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume !(0 == ~s__s3__tmp__reuse_message~0); {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-08 08:16:22,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume 8576 == ~state~0; {9821#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#(<= ssl3_accept_~s__state~0 8528)} assume 8592 == ~s__state~0; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {9817#false} assume -12288 != ~tmp___1~0; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {9817#false} assume -16384 != ~tmp___2~0; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {9817#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {9817#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {9817#false} assume 1024 != ~tmp___7~0; {9817#false} is VALID [2022-04-08 08:16:22,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {9817#false} assume 512 != ~tmp___7~0; {9817#false} is VALID [2022-04-08 08:16:22,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {9817#false} assume !false; {9817#false} is VALID [2022-04-08 08:16:22,625 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-08 08:16:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63832250] [2022-04-08 08:16:22,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63832250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:22,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:22,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:22,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [517045894] [2022-04-08 08:16:22,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [517045894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:22,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:22,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742633092] [2022-04-08 08:16:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:22,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2022-04-08 08:16:22,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:22,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:22,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:22,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:22,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:22,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:22,653 INFO L87 Difference]: Start difference. First operand 433 states and 641 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:24,165 INFO L93 Difference]: Finished difference Result 972 states and 1480 transitions. [2022-04-08 08:16:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:24,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 41 [2022-04-08 08:16:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-04-08 08:16:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2022-04-08 08:16:24,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 538 transitions. [2022-04-08 08:16:24,578 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-08 08:16:24,595 INFO L225 Difference]: With dead ends: 972 [2022-04-08 08:16:24,596 INFO L226 Difference]: Without dead ends: 529 [2022-04-08 08:16:24,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:24,598 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 348 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:24,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 235 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:16:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-08 08:16:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 489. [2022-04-08 08:16:25,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:25,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:25,408 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:25,410 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:25,425 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2022-04-08 08:16:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 791 transitions. [2022-04-08 08:16:25,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:25,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:25,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 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 529 states. [2022-04-08 08:16:25,429 INFO L87 Difference]: Start difference. First operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 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 529 states. [2022-04-08 08:16:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:25,445 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2022-04-08 08:16:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 791 transitions. [2022-04-08 08:16:25,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:25,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:25,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:25,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 484 states have (on average 1.5103305785123966) internal successors, (731), 484 states have internal predecessors, (731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 735 transitions. [2022-04-08 08:16:25,477 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 735 transitions. Word has length 41 [2022-04-08 08:16:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:25,478 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 735 transitions. [2022-04-08 08:16:25,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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-08 08:16:25,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 489 states and 735 transitions. [2022-04-08 08:16:26,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 735 edges. 735 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 735 transitions. [2022-04-08 08:16:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 08:16:26,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:26,182 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] [2022-04-08 08:16:26,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:16:26,182 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 162840181, now seen corresponding path program 1 times [2022-04-08 08:16:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:26,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663642474] [2022-04-08 08:16:26,183 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 162840181, now seen corresponding path program 2 times [2022-04-08 08:16:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:26,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362186339] [2022-04-08 08:16:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:26,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {13814#(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); {13808#true} is VALID [2022-04-08 08:16:26,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-08 08:16:26,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13808#true} {13808#true} #657#return; {13808#true} is VALID [2022-04-08 08:16:26,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {13808#true} call ULTIMATE.init(); {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:26,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {13814#(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); {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13808#true} {13808#true} #657#return; {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {13808#true} call #t~ret60 := main(); {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {13808#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {13808#true} call #t~ret59 := ssl3_accept(~s~0); {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {13808#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {13808#true} is VALID [2022-04-08 08:16:26,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {13808#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {13808#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {13808#true} assume !(0 != 12288 + ~tmp___1~0); {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {13808#true} assume !(0 == ~s__cert~0); {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {13808#true} assume !false; {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {13808#true} ~state~0 := ~s__state~0; {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {13808#true} assume !(12292 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {13808#true} assume !(16384 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {13808#true} assume !(8192 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {13808#true} assume !(24576 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {13808#true} assume !(8195 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {13808#true} assume !(8480 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {13808#true} assume !(8481 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {13808#true} assume !(8482 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {13808#true} assume !(8464 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {13808#true} assume !(8465 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {13808#true} assume !(8466 == ~s__state~0); {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {13808#true} assume 8496 == ~s__state~0; {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {13808#true} assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {13808#true} assume !(1 == ~blastFlag~0); {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {13808#true} assume !(3 == ~blastFlag~0); {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {13808#true} assume !(~ret~0 <= 0); {13808#true} is VALID [2022-04-08 08:16:26,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {13808#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:26,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} ~s__init_num~0 := 0; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:26,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:26,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume 8576 == ~state~0; {13813#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:26,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {13813#(<= 8656 ssl3_accept_~s__state~0)} assume 8592 == ~s__state~0; {13809#false} is VALID [2022-04-08 08:16:26,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {13809#false} assume -12288 != ~tmp___1~0; {13809#false} is VALID [2022-04-08 08:16:26,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {13809#false} assume -16384 != ~tmp___2~0; {13809#false} is VALID [2022-04-08 08:16:26,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {13809#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {13809#false} is VALID [2022-04-08 08:16:26,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {13809#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {13809#false} is VALID [2022-04-08 08:16:26,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {13809#false} assume 1024 != ~tmp___7~0; {13809#false} is VALID [2022-04-08 08:16:26,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {13809#false} assume 512 != ~tmp___7~0; {13809#false} is VALID [2022-04-08 08:16:26,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {13809#false} assume !false; {13809#false} is VALID [2022-04-08 08:16:26,269 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-08 08:16:26,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362186339] [2022-04-08 08:16:26,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362186339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:26,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:26,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:26,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:26,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663642474] [2022-04-08 08:16:26,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663642474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:26,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:26,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584965197] [2022-04-08 08:16:26,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:26,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 42 [2022-04-08 08:16:26,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:26,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-08 08:16:26,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:26,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:26,297 INFO L87 Difference]: Start difference. First operand 489 states and 735 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-08 08:16:27,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:27,804 INFO L93 Difference]: Finished difference Result 1058 states and 1625 transitions. [2022-04-08 08:16:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:27,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 42 [2022-04-08 08:16:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-08 08:16:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-08 08:16:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-08 08:16:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-08 08:16:27,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 518 transitions. [2022-04-08 08:16:28,209 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-08 08:16:28,230 INFO L225 Difference]: With dead ends: 1058 [2022-04-08 08:16:28,230 INFO L226 Difference]: Without dead ends: 583 [2022-04-08 08:16:28,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:28,236 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 293 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:28,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 238 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:16:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-04-08 08:16:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2022-04-08 08:16:29,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:29,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:29,138 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:29,140 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:29,157 INFO L93 Difference]: Finished difference Result 583 states and 852 transitions. [2022-04-08 08:16:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 852 transitions. [2022-04-08 08:16:29,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:29,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:29,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 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 583 states. [2022-04-08 08:16:29,160 INFO L87 Difference]: Start difference. First operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 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 583 states. [2022-04-08 08:16:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:29,176 INFO L93 Difference]: Finished difference Result 583 states and 852 transitions. [2022-04-08 08:16:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 852 transitions. [2022-04-08 08:16:29,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:29,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:29,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:29,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.4681978798586572) internal successors, (831), 566 states have internal predecessors, (831), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 835 transitions. [2022-04-08 08:16:29,218 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 835 transitions. Word has length 42 [2022-04-08 08:16:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:29,219 INFO L478 AbstractCegarLoop]: Abstraction has 571 states and 835 transitions. [2022-04-08 08:16:29,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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-08 08:16:29,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 571 states and 835 transitions. [2022-04-08 08:16:29,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 835 edges. 835 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 835 transitions. [2022-04-08 08:16:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 08:16:29,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:29,925 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-08 08:16:29,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:16:29,926 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1441142835, now seen corresponding path program 1 times [2022-04-08 08:16:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:29,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1674236565] [2022-04-08 08:16:29,926 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1441142835, now seen corresponding path program 2 times [2022-04-08 08:16:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:29,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313969688] [2022-04-08 08:16:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:29,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {18250#(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); {18244#true} is VALID [2022-04-08 08:16:29,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {18244#true} assume true; {18244#true} is VALID [2022-04-08 08:16:29,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18244#true} {18244#true} #657#return; {18244#true} is VALID [2022-04-08 08:16:29,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {18244#true} call ULTIMATE.init(); {18250#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:29,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {18250#(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); {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {18244#true} assume true; {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18244#true} {18244#true} #657#return; {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {18244#true} call #t~ret60 := main(); {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {18244#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {18244#true} call #t~ret59 := ssl3_accept(~s~0); {18244#true} is VALID [2022-04-08 08:16:29,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {18244#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {18244#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {18244#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {18244#true} assume !(0 != 12288 + ~tmp___1~0); {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {18244#true} assume !(0 == ~s__cert~0); {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {18244#true} assume !false; {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {18244#true} ~state~0 := ~s__state~0; {18244#true} is VALID [2022-04-08 08:16:29,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {18244#true} assume !(12292 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {18244#true} assume !(16384 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {18244#true} assume !(8192 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {18244#true} assume !(24576 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {18244#true} assume !(8195 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {18244#true} assume !(8480 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {18244#true} assume !(8481 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {18244#true} assume !(8482 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {18244#true} assume !(8464 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {18244#true} assume !(8465 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {18244#true} assume !(8466 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {18244#true} assume !(8496 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {18244#true} assume !(8497 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {18244#true} assume !(8512 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {18244#true} assume !(8513 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {18244#true} assume !(8528 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {18244#true} assume !(8529 == ~s__state~0); {18244#true} is VALID [2022-04-08 08:16:29,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {18244#true} assume 8544 == ~s__state~0; {18244#true} is VALID [2022-04-08 08:16:29,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {18244#true} assume !(0 != 1 + ~s__verify_mode~0);~skip~0 := 1;~s__s3__tmp__cert_request~0 := 0;~s__state~0 := 8560; {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-08 08:16:29,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume !(0 == ~s__s3__tmp__reuse_message~0); {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-08 08:16:29,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume 8576 == ~state~0; {18249#(<= ssl3_accept_~s__state~0 8560)} is VALID [2022-04-08 08:16:29,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {18249#(<= ssl3_accept_~s__state~0 8560)} assume 8592 == ~s__state~0; {18245#false} is VALID [2022-04-08 08:16:29,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {18245#false} assume -12288 != ~tmp___1~0; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {18245#false} assume -16384 != ~tmp___2~0; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {18245#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {18245#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {18245#false} assume 1024 != ~tmp___7~0; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {18245#false} assume 512 != ~tmp___7~0; {18245#false} is VALID [2022-04-08 08:16:29,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {18245#false} assume !false; {18245#false} is VALID [2022-04-08 08:16:29,982 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-08 08:16:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313969688] [2022-04-08 08:16:29,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313969688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:29,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:29,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:29,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1674236565] [2022-04-08 08:16:29,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1674236565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:29,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:29,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993441551] [2022-04-08 08:16:29,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2022-04-08 08:16:29,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:29,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-08 08:16:30,010 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-08 08:16:30,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:30,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:30,011 INFO L87 Difference]: Start difference. First operand 571 states and 835 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-08 08:16:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:31,644 INFO L93 Difference]: Finished difference Result 1224 states and 1828 transitions. [2022-04-08 08:16:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:31,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 43 [2022-04-08 08:16:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-08 08:16:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-08 08:16:31,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-08 08:16:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-08 08:16:31,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 519 transitions. [2022-04-08 08:16:31,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:32,011 INFO L225 Difference]: With dead ends: 1224 [2022-04-08 08:16:32,011 INFO L226 Difference]: Without dead ends: 643 [2022-04-08 08:16:32,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:32,012 INFO L913 BasicCegarLoop]: 228 mSDtfsCounter, 339 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:32,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 235 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:16:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-04-08 08:16:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 633. [2022-04-08 08:16:33,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:33,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:33,068 INFO L74 IsIncluded]: Start isIncluded. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:33,069 INFO L87 Difference]: Start difference. First operand 643 states. Second operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:33,088 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-04-08 08:16:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 953 transitions. [2022-04-08 08:16:33,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:33,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:33,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 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 643 states. [2022-04-08 08:16:33,092 INFO L87 Difference]: Start difference. First operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 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 643 states. [2022-04-08 08:16:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:33,111 INFO L93 Difference]: Finished difference Result 643 states and 953 transitions. [2022-04-08 08:16:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 953 transitions. [2022-04-08 08:16:33,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:33,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:33,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:33,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 628 states have (on average 1.4952229299363058) internal successors, (939), 628 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 943 transitions. [2022-04-08 08:16:33,138 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 943 transitions. Word has length 43 [2022-04-08 08:16:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:33,138 INFO L478 AbstractCegarLoop]: Abstraction has 633 states and 943 transitions. [2022-04-08 08:16:33,138 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-08 08:16:33,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 633 states and 943 transitions. [2022-04-08 08:16:33,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 943 transitions. [2022-04-08 08:16:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 08:16:33,911 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:33,911 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-08 08:16:33,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:16:33,911 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -111424063, now seen corresponding path program 1 times [2022-04-08 08:16:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [67050944] [2022-04-08 08:16:33,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -111424063, now seen corresponding path program 2 times [2022-04-08 08:16:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096648044] [2022-04-08 08:16:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:33,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:33,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {23263#(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); {23256#true} is VALID [2022-04-08 08:16:33,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {23256#true} assume true; {23256#true} is VALID [2022-04-08 08:16:33,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23256#true} {23256#true} #657#return; {23256#true} is VALID [2022-04-08 08:16:33,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {23256#true} call ULTIMATE.init(); {23263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:33,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {23263#(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); {23256#true} is VALID [2022-04-08 08:16:33,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {23256#true} assume true; {23256#true} is VALID [2022-04-08 08:16:33,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23256#true} {23256#true} #657#return; {23256#true} is VALID [2022-04-08 08:16:33,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {23256#true} call #t~ret60 := main(); {23256#true} is VALID [2022-04-08 08:16:34,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {23256#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {23256#true} is VALID [2022-04-08 08:16:34,000 INFO L272 TraceCheckUtils]: 6: Hoare triple {23256#true} call #t~ret59 := ssl3_accept(~s~0); {23256#true} is VALID [2022-04-08 08:16:34,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {23256#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {23256#true} is VALID [2022-04-08 08:16:34,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {23256#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {23256#true} is VALID [2022-04-08 08:16:34,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {23256#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {23256#true} is VALID [2022-04-08 08:16:34,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {23256#true} assume !(0 != 12288 + ~tmp___1~0); {23256#true} is VALID [2022-04-08 08:16:34,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {23256#true} assume !(0 == ~s__cert~0); {23256#true} is VALID [2022-04-08 08:16:34,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {23256#true} assume !false; {23256#true} is VALID [2022-04-08 08:16:34,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {23256#true} ~state~0 := ~s__state~0; {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8481 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8482 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8464 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8465 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8466 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8496 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8497 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8512 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8513 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8528 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8529 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8544 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8545 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8560 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8561 == ~s__state~0); {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:34,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {23261#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8448 == ~s__state~0; {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-08 08:16:34,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume !(~num1~0 > 0); {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-08 08:16:34,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-08 08:16:34,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume !(0 == ~s__s3__tmp__reuse_message~0); {23262#(<= ssl3_accept_~state~0 8448)} is VALID [2022-04-08 08:16:34,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {23262#(<= ssl3_accept_~state~0 8448)} assume 8576 == ~state~0; {23257#false} is VALID [2022-04-08 08:16:34,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {23257#false} assume 8592 == ~s__state~0; {23257#false} is VALID [2022-04-08 08:16:34,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {23257#false} assume -12288 != ~tmp___1~0; {23257#false} is VALID [2022-04-08 08:16:34,017 INFO L290 TraceCheckUtils]: 42: Hoare triple {23257#false} assume -16384 != ~tmp___2~0; {23257#false} is VALID [2022-04-08 08:16:34,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {23257#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {23257#false} is VALID [2022-04-08 08:16:34,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {23257#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {23257#false} is VALID [2022-04-08 08:16:34,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {23257#false} assume 1024 != ~tmp___7~0; {23257#false} is VALID [2022-04-08 08:16:34,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {23257#false} assume 512 != ~tmp___7~0; {23257#false} is VALID [2022-04-08 08:16:34,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {23257#false} assume !false; {23257#false} is VALID [2022-04-08 08:16:34,027 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-08 08:16:34,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096648044] [2022-04-08 08:16:34,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096648044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:34,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:34,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:34,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:34,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [67050944] [2022-04-08 08:16:34,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [67050944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:34,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:34,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:16:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100714079] [2022-04-08 08:16:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-08 08:16:34,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:34,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-08 08:16:34,060 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-08 08:16:34,060 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:16:34,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:16:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:34,061 INFO L87 Difference]: Start difference. First operand 633 states and 943 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-08 08:16:36,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:36,182 INFO L93 Difference]: Finished difference Result 1392 states and 2069 transitions. [2022-04-08 08:16:36,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:16:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 48 [2022-04-08 08:16:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-08 08:16:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2022-04-08 08:16:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-08 08:16:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2022-04-08 08:16:36,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 482 transitions. [2022-04-08 08:16:36,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 482 edges. 482 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:36,533 INFO L225 Difference]: With dead ends: 1392 [2022-04-08 08:16:36,533 INFO L226 Difference]: Without dead ends: 773 [2022-04-08 08:16:36,534 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:16:36,534 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 400 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:36,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 196 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:16:36,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-04-08 08:16:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 627. [2022-04-08 08:16:37,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:37,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:37,596 INFO L74 IsIncluded]: Start isIncluded. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:37,596 INFO L87 Difference]: Start difference. First operand 773 states. Second operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:37,624 INFO L93 Difference]: Finished difference Result 773 states and 1138 transitions. [2022-04-08 08:16:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1138 transitions. [2022-04-08 08:16:37,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:37,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:37,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 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 773 states. [2022-04-08 08:16:37,626 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 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 773 states. [2022-04-08 08:16:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:37,652 INFO L93 Difference]: Finished difference Result 773 states and 1138 transitions. [2022-04-08 08:16:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1138 transitions. [2022-04-08 08:16:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:37,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:37,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 622 states have (on average 1.5096463022508038) internal successors, (939), 622 states have internal predecessors, (939), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 943 transitions. [2022-04-08 08:16:37,672 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 943 transitions. Word has length 48 [2022-04-08 08:16:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:37,673 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 943 transitions. [2022-04-08 08:16:37,673 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-08 08:16:37,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 627 states and 943 transitions. [2022-04-08 08:16:38,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:38,460 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 943 transitions. [2022-04-08 08:16:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 08:16:38,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:38,461 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-08 08:16:38,461 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:16:38,462 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:38,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1022300905, now seen corresponding path program 1 times [2022-04-08 08:16:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:38,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011667556] [2022-04-08 08:16:38,462 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1022300905, now seen corresponding path program 2 times [2022-04-08 08:16:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:38,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931771852] [2022-04-08 08:16:38,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:38,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:38,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {28865#(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); {28859#true} is VALID [2022-04-08 08:16:38,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {28859#true} assume true; {28859#true} is VALID [2022-04-08 08:16:38,520 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28859#true} {28859#true} #657#return; {28859#true} is VALID [2022-04-08 08:16:38,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {28859#true} call ULTIMATE.init(); {28865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:38,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {28865#(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); {28859#true} is VALID [2022-04-08 08:16:38,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {28859#true} assume true; {28859#true} is VALID [2022-04-08 08:16:38,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28859#true} {28859#true} #657#return; {28859#true} is VALID [2022-04-08 08:16:38,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {28859#true} call #t~ret60 := main(); {28859#true} is VALID [2022-04-08 08:16:38,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {28859#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L272 TraceCheckUtils]: 6: Hoare triple {28859#true} call #t~ret59 := ssl3_accept(~s~0); {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {28859#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {28859#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {28859#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {28859#true} assume !(0 != 12288 + ~tmp___1~0); {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {28859#true} assume !(0 == ~s__cert~0); {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {28859#true} assume !false; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {28859#true} ~state~0 := ~s__state~0; {28859#true} is VALID [2022-04-08 08:16:38,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {28859#true} assume !(12292 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {28859#true} assume !(16384 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {28859#true} assume !(8192 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {28859#true} assume !(24576 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {28859#true} assume !(8195 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {28859#true} assume !(8480 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {28859#true} assume !(8481 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {28859#true} assume !(8482 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {28859#true} assume !(8464 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {28859#true} assume !(8465 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {28859#true} assume !(8466 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {28859#true} assume !(8496 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {28859#true} assume !(8497 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {28859#true} assume !(8512 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {28859#true} assume !(8513 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {28859#true} assume !(8528 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {28859#true} assume !(8529 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {28859#true} assume !(8544 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {28859#true} assume !(8545 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {28859#true} assume !(8560 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 34: Hoare triple {28859#true} assume !(8561 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 35: Hoare triple {28859#true} assume !(8448 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 36: Hoare triple {28859#true} assume !(8576 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 37: Hoare triple {28859#true} assume !(8577 == ~s__state~0); {28859#true} is VALID [2022-04-08 08:16:38,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {28859#true} assume 8592 == ~s__state~0; {28859#true} is VALID [2022-04-08 08:16:38,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {28859#true} assume -2147483648 <= #t~nondet51 && #t~nondet51 <= 2147483647;~ret~0 := #t~nondet51;havoc #t~nondet51; {28859#true} is VALID [2022-04-08 08:16:38,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {28859#true} assume !(~ret~0 <= 0);~s__state~0 := 8608;~s__init_num~0 := 0; {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:38,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume 8576 == ~state~0; {28864#(<= 8608 ssl3_accept_~s__state~0)} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {28864#(<= 8608 ssl3_accept_~s__state~0)} assume 8592 == ~s__state~0; {28860#false} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {28860#false} assume -12288 != ~tmp___1~0; {28860#false} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {28860#false} assume -16384 != ~tmp___2~0; {28860#false} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {28860#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {28860#false} is VALID [2022-04-08 08:16:38,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {28860#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {28860#false} is VALID [2022-04-08 08:16:38,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {28860#false} assume 1024 != ~tmp___7~0; {28860#false} is VALID [2022-04-08 08:16:38,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {28860#false} assume 512 != ~tmp___7~0; {28860#false} is VALID [2022-04-08 08:16:38,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {28860#false} assume !false; {28860#false} is VALID [2022-04-08 08:16:38,528 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-08 08:16:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:38,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931771852] [2022-04-08 08:16:38,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931771852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:38,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:38,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:38,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:38,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011667556] [2022-04-08 08:16:38,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011667556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:38,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:38,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910202032] [2022-04-08 08:16:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:38,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 51 [2022-04-08 08:16:38,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:38,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:38,560 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-08 08:16:38,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:38,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:38,561 INFO L87 Difference]: Start difference. First operand 627 states and 943 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:40,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:40,234 INFO L93 Difference]: Finished difference Result 1334 states and 2041 transitions. [2022-04-08 08:16:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:40,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 51 [2022-04-08 08:16:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-08 08:16:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-04-08 08:16:40,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 518 transitions. [2022-04-08 08:16:40,571 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-08 08:16:40,595 INFO L225 Difference]: With dead ends: 1334 [2022-04-08 08:16:40,595 INFO L226 Difference]: Without dead ends: 721 [2022-04-08 08:16:40,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:40,596 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 297 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:40,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 238 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 08:16:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-04-08 08:16:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 701. [2022-04-08 08:16:41,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:41,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:41,838 INFO L74 IsIncluded]: Start isIncluded. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:41,839 INFO L87 Difference]: Start difference. First operand 721 states. Second operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:41,856 INFO L93 Difference]: Finished difference Result 721 states and 1068 transitions. [2022-04-08 08:16:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1068 transitions. [2022-04-08 08:16:41,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:41,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:41,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 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 721 states. [2022-04-08 08:16:41,859 INFO L87 Difference]: Start difference. First operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 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 721 states. [2022-04-08 08:16:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:41,882 INFO L93 Difference]: Finished difference Result 721 states and 1068 transitions. [2022-04-08 08:16:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1068 transitions. [2022-04-08 08:16:41,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:41,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:41,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:41,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 696 states have internal predecessors, (1031), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1035 transitions. [2022-04-08 08:16:41,913 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1035 transitions. Word has length 51 [2022-04-08 08:16:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:41,914 INFO L478 AbstractCegarLoop]: Abstraction has 701 states and 1035 transitions. [2022-04-08 08:16:41,914 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:41,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 701 states and 1035 transitions. [2022-04-08 08:16:42,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1035 edges. 1035 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1035 transitions. [2022-04-08 08:16:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 08:16:42,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:42,788 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-08 08:16:42,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:16:42,788 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1802448233, now seen corresponding path program 1 times [2022-04-08 08:16:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1107781699] [2022-04-08 08:16:42,789 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1802448233, now seen corresponding path program 2 times [2022-04-08 08:16:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473785865] [2022-04-08 08:16:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:42,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:42,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {34389#(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); {34383#true} is VALID [2022-04-08 08:16:42,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {34383#true} assume true; {34383#true} is VALID [2022-04-08 08:16:42,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34383#true} {34383#true} #657#return; {34383#true} is VALID [2022-04-08 08:16:42,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {34383#true} call ULTIMATE.init(); {34389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:42,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {34389#(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); {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {34383#true} assume true; {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34383#true} {34383#true} #657#return; {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {34383#true} call #t~ret60 := main(); {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {34383#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L272 TraceCheckUtils]: 6: Hoare triple {34383#true} call #t~ret59 := ssl3_accept(~s~0); {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {34383#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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {34383#true} is VALID [2022-04-08 08:16:42,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {34383#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {34383#true} is VALID [2022-04-08 08:16:42,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {34383#true} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {34383#true} is VALID [2022-04-08 08:16:42,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {34383#true} assume !(0 != 12288 + ~tmp___1~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(0 == ~s__cert~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !false; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} ~state~0 := ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(12292 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(16384 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8192 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(24576 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8195 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8480 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8481 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8482 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8464 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8465 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8466 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8496 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8497 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8512 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8513 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8528 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8529 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8544 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8545 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8560 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8561 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(8448 == ~s__state~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8576 == ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~ret~0 := #t~nondet49;havoc #t~nondet49; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(~ret~0 <= 0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~ret~0 := #t~nondet50;havoc #t~nondet50; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(~ret~0 <= 0);~s__init_num~0 := 0;~s__state~0 := 8592; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume !(0 == ~s__s3__tmp__reuse_message~0); {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8576 == ~state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume 8592 == ~s__state~0; {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {34388#(= (+ ssl3_accept_~tmp___1~0 12288) 0)} assume -12288 != ~tmp___1~0; {34384#false} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {34384#false} assume -16384 != ~tmp___2~0; {34384#false} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {34384#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {34384#false} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {34384#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {34384#false} is VALID [2022-04-08 08:16:42,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {34384#false} assume 1024 != ~tmp___7~0; {34384#false} is VALID [2022-04-08 08:16:42,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {34384#false} assume 512 != ~tmp___7~0; {34384#false} is VALID [2022-04-08 08:16:42,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {34384#false} assume !false; {34384#false} is VALID [2022-04-08 08:16:42,879 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-08 08:16:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:42,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473785865] [2022-04-08 08:16:42,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473785865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:42,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:42,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1107781699] [2022-04-08 08:16:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1107781699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:42,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:16:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019222255] [2022-04-08 08:16:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 51 [2022-04-08 08:16:42,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:42,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:42,915 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-08 08:16:42,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:16:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:16:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:16:42,916 INFO L87 Difference]: Start difference. First operand 701 states and 1035 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:45,890 INFO L93 Difference]: Finished difference Result 2066 states and 3050 transitions. [2022-04-08 08:16:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:16:45,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 51 [2022-04-08 08:16:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2022-04-08 08:16:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2022-04-08 08:16:45,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 609 transitions. [2022-04-08 08:16:46,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:46,371 INFO L225 Difference]: With dead ends: 2066 [2022-04-08 08:16:46,372 INFO L226 Difference]: Without dead ends: 1379 [2022-04-08 08:16:46,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:16:46,373 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 558 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:46,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 225 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:16:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2022-04-08 08:16:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1377. [2022-04-08 08:16:48,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:48,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:48,676 INFO L74 IsIncluded]: Start isIncluded. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:48,677 INFO L87 Difference]: Start difference. First operand 1379 states. Second operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:48,725 INFO L93 Difference]: Finished difference Result 1379 states and 2031 transitions. [2022-04-08 08:16:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2031 transitions. [2022-04-08 08:16:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:48,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 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 1379 states. [2022-04-08 08:16:48,728 INFO L87 Difference]: Start difference. First operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 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 1379 states. [2022-04-08 08:16:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:48,794 INFO L93 Difference]: Finished difference Result 1379 states and 2031 transitions. [2022-04-08 08:16:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2031 transitions. [2022-04-08 08:16:48,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:48,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:48,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:48,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1372 states have (on average 1.4766763848396502) internal successors, (2026), 1372 states have internal predecessors, (2026), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2030 transitions. [2022-04-08 08:16:48,914 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2030 transitions. Word has length 51 [2022-04-08 08:16:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:48,915 INFO L478 AbstractCegarLoop]: Abstraction has 1377 states and 2030 transitions. [2022-04-08 08:16:48,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-08 08:16:48,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1377 states and 2030 transitions. [2022-04-08 08:16:50,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2030 edges. 2030 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2030 transitions. [2022-04-08 08:16:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 08:16:50,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:16:50,713 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] [2022-04-08 08:16:50,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:16:50,714 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:16:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:16:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 821412563, now seen corresponding path program 1 times [2022-04-08 08:16:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11985062] [2022-04-08 08:16:50,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:16:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 821412563, now seen corresponding path program 2 times [2022-04-08 08:16:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:16:50,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383721342] [2022-04-08 08:16:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:16:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:16:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:16:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:16:50,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {44046#(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); {44038#true} is VALID [2022-04-08 08:16:50,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {44038#true} assume true; {44038#true} is VALID [2022-04-08 08:16:50,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44038#true} {44038#true} #657#return; {44038#true} is VALID [2022-04-08 08:16:50,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {44038#true} call ULTIMATE.init(); {44046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:16:50,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {44046#(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); {44038#true} is VALID [2022-04-08 08:16:50,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {44038#true} assume true; {44038#true} is VALID [2022-04-08 08:16:50,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44038#true} {44038#true} #657#return; {44038#true} is VALID [2022-04-08 08:16:50,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {44038#true} call #t~ret60 := main(); {44038#true} is VALID [2022-04-08 08:16:50,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {44038#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {44043#(<= main_~s~0 8464)} is VALID [2022-04-08 08:16:50,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {44043#(<= main_~s~0 8464)} call #t~ret59 := ssl3_accept(~s~0); {44044#(<= |ssl3_accept_#in~initial_state| 8464)} is VALID [2022-04-08 08:16:50,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {44044#(<= |ssl3_accept_#in~initial_state| 8464)} ~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;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet19;havoc #t~nondet19;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~num1~0 := #t~nondet20;havoc #t~nondet20;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___1~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___2~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___3~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___4~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___5~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___6~0 := #t~nondet26;havoc #t~nondet26;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp___7~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___8~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___9~0 := #t~nondet29;havoc #t~nondet29;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___10~0 := #t~nondet30;havoc #t~nondet30;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;~__cil_tmp58~0 := #t~nondet31;havoc #t~nondet31;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp~0 := #t~nondet32;havoc #t~nondet32;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} #t~post33 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post33;havoc #t~post33; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 12288 + ~tmp___1~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 0 != 16384 + ~tmp___2~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(0 == ~s__cert~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !false; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} ~state~0 := ~s__state~0; {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(12292 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(16384 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8192 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(24576 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8195 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8480 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8481 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8482 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8464 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8465 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8466 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8496 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8497 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8512 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8513 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8528 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8529 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8544 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8545 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8560 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8561 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume !(8448 == ~s__state~0); {44045#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {44045#(<= ssl3_accept_~s__state~0 8464)} assume 8576 == ~s__state~0; {44039#false} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {44039#false} assume -2147483648 <= #t~nondet49 && #t~nondet49 <= 2147483647;~ret~0 := #t~nondet49;havoc #t~nondet49; {44039#false} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {44039#false} assume !(~ret~0 <= 0); {44039#false} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {44039#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet50 && #t~nondet50 <= 2147483647;~ret~0 := #t~nondet50;havoc #t~nondet50; {44039#false} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {44039#false} assume !(~ret~0 <= 0);~s__init_num~0 := 0;~s__state~0 := 8592; {44039#false} is VALID [2022-04-08 08:16:50,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {44039#false} assume !(0 == ~s__s3__tmp__reuse_message~0); {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {44039#false} assume 8576 == ~state~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {44039#false} assume 8592 == ~s__state~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {44039#false} assume -12288 != ~tmp___1~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {44039#false} assume -16384 != ~tmp___2~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {44039#false} assume 4294967040 != ~__cil_tmp56~0 % 4294967296; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 48: Hoare triple {44039#false} assume 4294967294 != ~__cil_tmp58~0 % 4294967296; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 49: Hoare triple {44039#false} assume 1024 != ~tmp___7~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 50: Hoare triple {44039#false} assume 512 != ~tmp___7~0; {44039#false} is VALID [2022-04-08 08:16:50,797 INFO L290 TraceCheckUtils]: 51: Hoare triple {44039#false} assume !false; {44039#false} is VALID [2022-04-08 08:16:50,798 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-08 08:16:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:16:50,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383721342] [2022-04-08 08:16:50,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383721342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:50,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:50,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:16:50,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:16:50,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11985062] [2022-04-08 08:16:50,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11985062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:16:50,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:16:50,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:16:50,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940515870] [2022-04-08 08:16:50,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:16:50,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 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 52 [2022-04-08 08:16:50,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:16:50,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:50,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:50,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:16:50,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:16:50,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:16:50,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:16:50,834 INFO L87 Difference]: Start difference. First operand 1377 states and 2030 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:55,536 INFO L93 Difference]: Finished difference Result 2953 states and 4379 transitions. [2022-04-08 08:16:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:16:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 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 52 [2022-04-08 08:16:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:16:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-04-08 08:16:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2022-04-08 08:16:55,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 519 transitions. [2022-04-08 08:16:55,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 519 edges. 519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:16:55,990 INFO L225 Difference]: With dead ends: 2953 [2022-04-08 08:16:55,990 INFO L226 Difference]: Without dead ends: 1567 [2022-04-08 08:16:55,992 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-08 08:16:55,992 INFO L913 BasicCegarLoop]: 177 mSDtfsCounter, 614 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:16:55,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 194 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 08:16:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2022-04-08 08:16:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1453. [2022-04-08 08:16:59,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:16:59,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:59,248 INFO L74 IsIncluded]: Start isIncluded. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:59,249 INFO L87 Difference]: Start difference. First operand 1567 states. Second operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:59,353 INFO L93 Difference]: Finished difference Result 1567 states and 2260 transitions. [2022-04-08 08:16:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2260 transitions. [2022-04-08 08:16:59,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:59,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:59,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 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 1567 states. [2022-04-08 08:16:59,360 INFO L87 Difference]: Start difference. First operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 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 1567 states. [2022-04-08 08:16:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:16:59,472 INFO L93 Difference]: Finished difference Result 1567 states and 2260 transitions. [2022-04-08 08:16:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2260 transitions. [2022-04-08 08:16:59,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:16:59,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:16:59,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:16:59,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:16:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1448 states have (on average 1.473756906077348) internal successors, (2134), 1448 states have internal predecessors, (2134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2138 transitions. [2022-04-08 08:16:59,614 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2138 transitions. Word has length 52 [2022-04-08 08:16:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:16:59,614 INFO L478 AbstractCegarLoop]: Abstraction has 1453 states and 2138 transitions. [2022-04-08 08:16:59,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:16:59,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2138 transitions. [2022-04-08 08:17:01,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2138 edges. 2138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:17:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2138 transitions. [2022-04-08 08:17:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 08:17:01,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:17:01,588 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 08:17:01,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:17:01,588 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:17:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:17:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1685857253, now seen corresponding path program 1 times [2022-04-08 08:17:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:17:01,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614059597] [2022-04-08 08:17:01,748 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationTermSequential(JordanLoopAcceleration.java:693) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.createLoopAccelerationFormula(JordanLoopAcceleration.java:528) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.accelerateLoop(JordanLoopAcceleration.java:156) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorJordan.accelerateLoop(AcceleratorJordan.java:88) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:17:01,755 INFO L158 Benchmark]: Toolchain (without parser) took 51778.72ms. Allocated memory was 177.2MB in the beginning and 255.9MB in the end (delta: 78.6MB). Free memory was 120.4MB in the beginning and 157.0MB in the end (delta: -36.5MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2022-04-08 08:17:01,755 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:17:01,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.05ms. Allocated memory is still 177.2MB. Free memory was 120.3MB in the beginning and 141.8MB in the end (delta: -21.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-08 08:17:01,759 INFO L158 Benchmark]: Boogie Preprocessor took 93.99ms. Allocated memory is still 177.2MB. Free memory was 141.8MB in the beginning and 139.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-08 08:17:01,759 INFO L158 Benchmark]: RCFGBuilder took 700.74ms. Allocated memory is still 177.2MB. Free memory was 139.1MB in the beginning and 102.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-08 08:17:01,759 INFO L158 Benchmark]: TraceAbstraction took 50576.93ms. Allocated memory was 177.2MB in the beginning and 255.9MB in the end (delta: 78.6MB). Free memory was 102.0MB in the beginning and 157.0MB in the end (delta: -55.0MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2022-04-08 08:17:01,761 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.05ms. Allocated memory is still 177.2MB. Free memory was 120.3MB in the beginning and 141.8MB in the end (delta: -21.5MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.99ms. Allocated memory is still 177.2MB. Free memory was 141.8MB in the beginning and 139.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 700.74ms. Allocated memory is still 177.2MB. Free memory was 139.1MB in the beginning and 102.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 50576.93ms. Allocated memory was 177.2MB in the beginning and 255.9MB in the end (delta: 78.6MB). Free memory was 102.0MB in the beginning and 157.0MB in the end (delta: -55.0MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Computed reflexive-transitive closure does not contain relation itself.Something went wrong in computation of loop acceleration formula.: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula(JordanLoopAcceleration.java:1038) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:17:01,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...