/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:49:33,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:49:33,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:49:33,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:49:33,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:49:33,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:49:33,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:49:33,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:49:33,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:49:33,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:49:33,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:49:33,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:49:33,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:49:33,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:49:33,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:49:33,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:49:33,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:49:33,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:49:33,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:49:33,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:49:33,484 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:49:33,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:49:33,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:49:33,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:49:33,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:49:33,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:49:33,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:49:33,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:49:33,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:49:33,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:49:33,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:49:33,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:49:33,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:49:33,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:49:33,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:49:33,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:49:33,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:49:33,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:49:33,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:49:33,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:49:33,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:49:33,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:49:33,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:49:33,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:49:33,499 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:49:33,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:49:33,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:49:33,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:49:33,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:49:33,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:49:33,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:49:33,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:49:33,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:49:33,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:49:33,502 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 17:49:33,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:49:33,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:49:33,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:49:33,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:49:33,711 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:49:33,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-04-15 17:49:33,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911e45236/0d614c41c1824611999fc2d1b5b06d5d/FLAG542dd71d8 [2022-04-15 17:49:34,107 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:49:34,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_13.cil.c [2022-04-15 17:49:34,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911e45236/0d614c41c1824611999fc2d1b5b06d5d/FLAG542dd71d8 [2022-04-15 17:49:34,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911e45236/0d614c41c1824611999fc2d1b5b06d5d [2022-04-15 17:49:34,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:49:34,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:49:34,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:49:34,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:49:34,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:49:34,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a688289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34, skipping insertion in model container [2022-04-15 17:49:34,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:49:34,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:49:34,815 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_13.cil.c[45032,45045] [2022-04-15 17:49:34,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:49:34,831 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:49:34,869 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_13.cil.c[45032,45045] [2022-04-15 17:49:34,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:49:34,879 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:49:34,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34 WrapperNode [2022-04-15 17:49:34,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:49:34,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:49:34,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:49:34,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:49:34,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:49:34,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:49:34,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:49:34,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:49:34,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (1/1) ... [2022-04-15 17:49:34,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:49:34,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:49:34,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 17:49:34,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 17:49:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:49:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:49:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:49:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 17:49:34,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:49:34,986 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:49:34,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:49:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:49:34,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:49:35,042 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:49:35,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:49:35,105 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:49:35,501 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-15 17:49:35,502 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-15 17:49:35,508 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:49:35,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:49:35,513 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:49:35,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:49:35 BoogieIcfgContainer [2022-04-15 17:49:35,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:49:35,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:49:35,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:49:35,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:49:35,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:49:34" (1/3) ... [2022-04-15 17:49:35,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f53a175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:49:35, skipping insertion in model container [2022-04-15 17:49:35,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:49:34" (2/3) ... [2022-04-15 17:49:35,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f53a175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:49:35, skipping insertion in model container [2022-04-15 17:49:35,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:49:35" (3/3) ... [2022-04-15 17:49:35,523 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2022-04-15 17:49:35,526 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:49:35,526 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:49:35,553 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:49:35,557 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 17:49:35,557 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:49:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 155 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 17:49:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 17:49:35,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:35,625 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-15 17:49:35,625 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash -963493744, now seen corresponding path program 1 times [2022-04-15 17:49:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:35,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456915493] [2022-04-15 17:49:35,645 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -963493744, now seen corresponding path program 2 times [2022-04-15 17:49:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:35,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922865409] [2022-04-15 17:49:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:35,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(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); {165#true} is VALID [2022-04-15 17:49:35,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 17:49:35,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #674#return; {165#true} is VALID [2022-04-15 17:49:35,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:35,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(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); {165#true} is VALID [2022-04-15 17:49:35,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-15 17:49:35,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #674#return; {165#true} is VALID [2022-04-15 17:49:35,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret59 := main(); {165#true} is VALID [2022-04-15 17:49:35,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {165#true} is VALID [2022-04-15 17:49:35,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {165#true} call #t~ret58 := ssl3_accept(~s~0); {165#true} is VALID [2022-04-15 17:49:35,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {165#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {165#true} is VALID [2022-04-15 17:49:35,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {165#true} is VALID [2022-04-15 17:49:35,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {165#true} is VALID [2022-04-15 17:49:35,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#true} assume !(0 != 12288 + ~tmp___1~0); {165#true} is VALID [2022-04-15 17:49:35,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#true} assume !(0 == ~s__cert~0); {165#true} is VALID [2022-04-15 17:49:35,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {165#true} assume !false; {165#true} is VALID [2022-04-15 17:49:35,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {165#true} ~state~0 := ~s__state~0; {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:35,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8480 == ~s__state~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 0 == ~s__s3__tmp__reuse_message~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 0 == ~skip~0; {171#(<= ssl3_accept_~state~0 8480)} is VALID [2022-04-15 17:49:35,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {171#(<= ssl3_accept_~state~0 8480)} assume 8528 == ~state~0; {166#false} is VALID [2022-04-15 17:49:35,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume 8544 == ~s__state~0; {166#false} is VALID [2022-04-15 17:49:35,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume 1024 != ~tmp___7~0; {166#false} is VALID [2022-04-15 17:49:35,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume 512 != ~tmp___7~0; {166#false} is VALID [2022-04-15 17:49:35,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {166#false} is VALID [2022-04-15 17:49:35,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume 4294967266 != ~l~0 % 18446744073709551616; {166#false} is VALID [2022-04-15 17:49:35,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-15 17:49:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:35,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922865409] [2022-04-15 17:49:35,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922865409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:35,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:35,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:35,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456915493] [2022-04-15 17:49:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456915493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:35,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475323105] [2022-04-15 17:49:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:35,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:35,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:35,871 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-15 17:49:35,872 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:49:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:49:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:49:35,886 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 155 states have internal predecessors, (266), 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 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:36,905 INFO L93 Difference]: Finished difference Result 364 states and 611 transitions. [2022-04-15 17:49:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:36,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-04-15 17:49:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-04-15 17:49:36,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 611 transitions. [2022-04-15 17:49:37,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:37,337 INFO L225 Difference]: With dead ends: 364 [2022-04-15 17:49:37,337 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 17:49:37,339 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-15 17:49:37,341 INFO L913 BasicCegarLoop]: 231 mSDtfsCounter, 542 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:37,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 246 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:49:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 17:49:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 162. [2022-04-15 17:49:37,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:37,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:37,445 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:37,446 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:37,452 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2022-04-15 17:49:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2022-04-15 17:49:37,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:37,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:37,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 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 185 states. [2022-04-15 17:49:37,454 INFO L87 Difference]: Start difference. First operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 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 185 states. [2022-04-15 17:49:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:37,459 INFO L93 Difference]: Finished difference Result 185 states and 276 transitions. [2022-04-15 17:49:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 276 transitions. [2022-04-15 17:49:37,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:37,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:37,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:37,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.5414012738853504) internal successors, (242), 157 states have internal predecessors, (242), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 246 transitions. [2022-04-15 17:49:37,467 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 246 transitions. Word has length 32 [2022-04-15 17:49:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:37,467 INFO L478 AbstractCegarLoop]: Abstraction has 162 states and 246 transitions. [2022-04-15 17:49:37,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-15 17:49:37,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 162 states and 246 transitions. [2022-04-15 17:49:37,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 246 transitions. [2022-04-15 17:49:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 17:49:37,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:37,647 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-15 17:49:37,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:49:37,648 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -76895489, now seen corresponding path program 1 times [2022-04-15 17:49:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842821065] [2022-04-15 17:49:37,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash -76895489, now seen corresponding path program 2 times [2022-04-15 17:49:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:37,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595087595] [2022-04-15 17:49:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:37,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1613#(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); {1606#true} is VALID [2022-04-15 17:49:37,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 17:49:37,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1606#true} {1606#true} #674#return; {1606#true} is VALID [2022-04-15 17:49:37,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {1606#true} call ULTIMATE.init(); {1613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:37,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1613#(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); {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1606#true} assume true; {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1606#true} {1606#true} #674#return; {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {1606#true} call #t~ret59 := main(); {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {1606#true} call #t~ret58 := ssl3_accept(~s~0); {1606#true} is VALID [2022-04-15 17:49:37,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1606#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {1606#true} is VALID [2022-04-15 17:49:37,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {1606#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {1606#true} is VALID [2022-04-15 17:49:37,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {1606#true} is VALID [2022-04-15 17:49:37,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {1606#true} assume !(0 != 12288 + ~tmp___1~0); {1606#true} is VALID [2022-04-15 17:49:37,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {1606#true} assume !(0 == ~s__cert~0); {1606#true} is VALID [2022-04-15 17:49:37,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#true} assume !false; {1606#true} is VALID [2022-04-15 17:49:37,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1606#true} ~state~0 := ~s__state~0; {1611#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1611#(<= ssl3_accept_~s__state~0 ssl3_accept_~state~0)} assume 12292 == ~s__state~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~s__new_session~0 := 1; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~s__server~0 := 1; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 != ~cb~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} ~__cil_tmp55~0 := 8 * ~s__version~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(3 != ~__cil_tmp55~0);~s__type~0 := 8192; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~s__init_buf___0~0); {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(0 == ~tmp___4~0);~s__init_num~0 := 0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume !(12292 != ~s__state~0);#t~post34 := ~s__ctx__stats__sess_accept_renegotiate~0;~s__ctx__stats__sess_accept_renegotiate~0 := 1 + #t~post34;havoc #t~post34;~s__state~0 := 8480; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~s__s3__tmp__reuse_message~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 0 == ~skip~0; {1612#(<= 12292 ssl3_accept_~state~0)} is VALID [2022-04-15 17:49:37,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#(<= 12292 ssl3_accept_~state~0)} assume 8528 == ~state~0; {1607#false} is VALID [2022-04-15 17:49:37,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {1607#false} assume 8544 == ~s__state~0; {1607#false} is VALID [2022-04-15 17:49:37,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {1607#false} assume 1024 != ~tmp___7~0; {1607#false} is VALID [2022-04-15 17:49:37,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {1607#false} assume 512 != ~tmp___7~0; {1607#false} is VALID [2022-04-15 17:49:37,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {1607#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {1607#false} is VALID [2022-04-15 17:49:37,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {1607#false} assume 4294967266 != ~l~0 % 18446744073709551616; {1607#false} is VALID [2022-04-15 17:49:37,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {1607#false} assume !false; {1607#false} is VALID [2022-04-15 17:49:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:37,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595087595] [2022-04-15 17:49:37,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595087595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:37,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:37,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:37,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842821065] [2022-04-15 17:49:37,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842821065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:37,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:37,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786051003] [2022-04-15 17:49:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:37,740 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-15 17:49:37,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:37,740 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-15 17:49:37,759 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-15 17:49:37,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:49:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:37,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:49:37,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:49:37,759 INFO L87 Difference]: Start difference. First operand 162 states and 246 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-15 17:49:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:38,563 INFO L93 Difference]: Finished difference Result 330 states and 501 transitions. [2022-04-15 17:49:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:49:38,563 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-15 17:49:38,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:38,563 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-15 17:49:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 17:49:38,567 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-15 17:49:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-15 17:49:38,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-15 17:49:38,876 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-15 17:49:38,880 INFO L225 Difference]: With dead ends: 330 [2022-04-15 17:49:38,880 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 17:49:38,881 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-15 17:49:38,882 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 424 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:38,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 181 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 17:49:39,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2022-04-15 17:49:39,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:39,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:39,015 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:39,015 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,022 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2022-04-15 17:49:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2022-04-15 17:49:39,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:39,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:39,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 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 182 states. [2022-04-15 17:49:39,023 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 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 182 states. [2022-04-15 17:49:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,030 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2022-04-15 17:49:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2022-04-15 17:49:39,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:39,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:39,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:39,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.5578231292517006) internal successors, (229), 147 states have internal predecessors, (229), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2022-04-15 17:49:39,036 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 33 [2022-04-15 17:49:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:39,036 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2022-04-15 17:49:39,036 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-15 17:49:39,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 233 transitions. [2022-04-15 17:49:39,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2022-04-15 17:49:39,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 17:49:39,189 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:39,189 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-15 17:49:39,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:49:39,189 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:39,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1425858867, now seen corresponding path program 1 times [2022-04-15 17:49:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:39,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409582891] [2022-04-15 17:49:39,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1425858867, now seen corresponding path program 2 times [2022-04-15 17:49:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:39,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683995677] [2022-04-15 17:49:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:39,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:39,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {2956#(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); {2950#true} is VALID [2022-04-15 17:49:39,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 17:49:39,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2950#true} {2950#true} #674#return; {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {2950#true} call ULTIMATE.init(); {2956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:39,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {2956#(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); {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {2950#true} assume true; {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2950#true} {2950#true} #674#return; {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {2950#true} call #t~ret59 := main(); {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {2950#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {2950#true} is VALID [2022-04-15 17:49:39,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {2950#true} call #t~ret58 := ssl3_accept(~s~0); {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {2950#true} assume !(0 != 12288 + ~tmp___1~0); {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {2950#true} assume !(0 == ~s__cert~0); {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {2950#true} assume !false; {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {2950#true} ~state~0 := ~s__state~0; {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {2950#true} assume !(12292 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {2950#true} assume !(16384 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {2950#true} assume !(8192 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {2950#true} assume !(24576 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {2950#true} assume !(8195 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {2950#true} assume !(8480 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {2950#true} assume !(8481 == ~s__state~0); {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {2950#true} assume 8482 == ~s__state~0; {2950#true} is VALID [2022-04-15 17:49:39,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {2950#true} ~s__state~0 := 3; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 17:49:39,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 17:49:39,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 0 == ~s__s3__tmp__reuse_message~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 17:49:39,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 0 == ~skip~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 8528 == ~state~0; {2955#(= ssl3_accept_~s__state~0 3)} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {2955#(= ssl3_accept_~s__state~0 3)} assume 8544 == ~s__state~0; {2951#false} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#false} assume 1024 != ~tmp___7~0; {2951#false} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {2951#false} assume 512 != ~tmp___7~0; {2951#false} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {2951#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {2951#false} is VALID [2022-04-15 17:49:39,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {2951#false} assume 4294967266 != ~l~0 % 18446744073709551616; {2951#false} is VALID [2022-04-15 17:49:39,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#false} assume !false; {2951#false} is VALID [2022-04-15 17:49:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683995677] [2022-04-15 17:49:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683995677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:39,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:39,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:39,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:39,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409582891] [2022-04-15 17:49:39,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409582891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:39,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:39,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512080380] [2022-04-15 17:49:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:39,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:39,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,336 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-15 17:49:39,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:39,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:39,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:39,337 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:39,939 INFO L93 Difference]: Finished difference Result 337 states and 535 transitions. [2022-04-15 17:49:39,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:39,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-15 17:49:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2022-04-15 17:49:39,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 519 transitions. [2022-04-15 17:49:40,205 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-15 17:49:40,207 INFO L225 Difference]: With dead ends: 337 [2022-04-15 17:49:40,207 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 17:49:40,207 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-15 17:49:40,208 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 269 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:40,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 244 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 17:49:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-04-15 17:49:40,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:40,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:40,355 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:40,355 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:40,358 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2022-04-15 17:49:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 17:49:40,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:40,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:40,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 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 151 states. [2022-04-15 17:49:40,359 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 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 151 states. [2022-04-15 17:49:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:40,362 INFO L93 Difference]: Finished difference Result 151 states and 230 transitions. [2022-04-15 17:49:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 17:49:40,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:40,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:40,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:40,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.547945205479452) internal successors, (226), 146 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2022-04-15 17:49:40,366 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 33 [2022-04-15 17:49:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:40,366 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2022-04-15 17:49:40,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 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-15 17:49:40,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 230 transitions. [2022-04-15 17:49:40,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2022-04-15 17:49:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 17:49:40,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:40,519 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-15 17:49:40,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:49:40,519 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:40,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -319735020, now seen corresponding path program 1 times [2022-04-15 17:49:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469015569] [2022-04-15 17:49:40,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -319735020, now seen corresponding path program 2 times [2022-04-15 17:49:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:40,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706365605] [2022-04-15 17:49:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:40,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:40,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {4247#(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); {4240#true} is VALID [2022-04-15 17:49:40,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 17:49:40,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4240#true} {4240#true} #674#return; {4240#true} is VALID [2022-04-15 17:49:40,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {4240#true} call ULTIMATE.init(); {4247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {4247#(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); {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {4240#true} assume true; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4240#true} {4240#true} #674#return; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {4240#true} call #t~ret59 := main(); {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {4240#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L272 TraceCheckUtils]: 6: Hoare triple {4240#true} call #t~ret58 := ssl3_accept(~s~0); {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {4240#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {4240#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {4240#true} assume !(0 != 12288 + ~tmp___1~0); {4240#true} is VALID [2022-04-15 17:49:40,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {4240#true} assume !(0 == ~s__cert~0); {4240#true} is VALID [2022-04-15 17:49:40,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4240#true} assume !false; {4240#true} is VALID [2022-04-15 17:49:40,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {4240#true} ~state~0 := ~s__state~0; {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:40,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {4245#(<= ssl3_accept_~state~0 ssl3_accept_~s__state~0)} assume 8481 == ~s__state~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} ~s__shutdown~0 := 0;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~ret~0 := #t~nondet35;havoc #t~nondet35; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume !(~ret~0 <= 0);~s__s3__tmp__next_state___0~0 := 8482;~s__state~0 := 8448;~s__init_num~0 := 0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 0 == ~s__s3__tmp__reuse_message~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 0 == ~skip~0; {4246#(<= ssl3_accept_~state~0 8481)} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {4246#(<= ssl3_accept_~state~0 8481)} assume 8528 == ~state~0; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {4241#false} assume 8544 == ~s__state~0; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {4241#false} assume 1024 != ~tmp___7~0; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {4241#false} assume 512 != ~tmp___7~0; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {4241#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {4241#false} assume 4294967266 != ~l~0 % 18446744073709551616; {4241#false} is VALID [2022-04-15 17:49:40,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {4241#false} assume !false; {4241#false} is VALID [2022-04-15 17:49:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706365605] [2022-04-15 17:49:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706365605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:40,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469015569] [2022-04-15 17:49:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469015569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:49:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118275276] [2022-04-15 17:49:40,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:40,601 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-15 17:49:40,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:40,601 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-15 17:49:40,635 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-15 17:49:40,635 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:49:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:40,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:49:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:49:40,636 INFO L87 Difference]: Start difference. First operand 151 states and 230 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-15 17:49:41,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:41,453 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2022-04-15 17:49:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:41,454 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-15 17:49:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:41,454 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-15 17:49:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2022-04-15 17:49:41,457 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-15 17:49:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2022-04-15 17:49:41,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 476 transitions. [2022-04-15 17:49:41,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:41,783 INFO L225 Difference]: With dead ends: 329 [2022-04-15 17:49:41,783 INFO L226 Difference]: Without dead ends: 192 [2022-04-15 17:49:41,784 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-15 17:49:41,784 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 421 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:41,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 188 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:41,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-04-15 17:49:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 149. [2022-04-15 17:49:41,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:41,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:41,966 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:41,967 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:41,970 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2022-04-15 17:49:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-04-15 17:49:41,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:41,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:41,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 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 192 states. [2022-04-15 17:49:41,971 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 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 192 states. [2022-04-15 17:49:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:41,974 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2022-04-15 17:49:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-04-15 17:49:41,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:41,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:41,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:41,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.5555555555555556) internal successors, (224), 144 states have internal predecessors, (224), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2022-04-15 17:49:41,977 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 33 [2022-04-15 17:49:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:41,977 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2022-04-15 17:49:41,977 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-15 17:49:41,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 228 transitions. [2022-04-15 17:49:42,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2022-04-15 17:49:42,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 17:49:42,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:42,173 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:42,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:49:42,174 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1614356125, now seen corresponding path program 1 times [2022-04-15 17:49:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:42,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335914190] [2022-04-15 17:49:42,174 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1614356125, now seen corresponding path program 2 times [2022-04-15 17:49:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:42,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185195018] [2022-04-15 17:49:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:42,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {5605#(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); {5599#true} is VALID [2022-04-15 17:49:42,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 17:49:42,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5599#true} {5599#true} #674#return; {5599#true} is VALID [2022-04-15 17:49:42,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:42,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {5605#(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); {5599#true} is VALID [2022-04-15 17:49:42,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 17:49:42,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #674#return; {5599#true} is VALID [2022-04-15 17:49:42,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret59 := main(); {5599#true} is VALID [2022-04-15 17:49:42,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {5599#true} is VALID [2022-04-15 17:49:42,247 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call #t~ret58 := ssl3_accept(~s~0); {5599#true} is VALID [2022-04-15 17:49:42,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != 12288 + ~tmp___1~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~s__cert~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !false; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} ~state~0 := ~s__state~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == ~s__state~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 8544 == ~s__state~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 0 != 1 + ~s__verify_mode~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != ~s__session__peer~0); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet44;havoc #t~nondet44;~__cil_tmp61~0 := ~s__s3__tmp__new_cipher__algorithms~0; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (256 + ~__cil_tmp61~0) % 18446744073709551616); {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} ~s__s3__tmp__cert_request~0 := 1;assume -2147483648 <= #t~nondet45 && #t~nondet45 <= 2147483647;~ret~0 := #t~nondet45;havoc #t~nondet45; {5604#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 17:49:42,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {5604#(= ssl3_accept_~blastFlag~0 0)} assume 8 == ~blastFlag~0; {5600#false} is VALID [2022-04-15 17:49:42,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 17:49:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:42,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185195018] [2022-04-15 17:49:42,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185195018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:42,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:42,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:42,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:42,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335914190] [2022-04-15 17:49:42,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335914190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:42,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:42,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337271601] [2022-04-15 17:49:42,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:42,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2022-04-15 17:49:42,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:42,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:42,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:42,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:42,281 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:43,057 INFO L93 Difference]: Finished difference Result 418 states and 647 transitions. [2022-04-15 17:49:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2022-04-15 17:49:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-15 17:49:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-04-15 17:49:43,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 629 transitions. [2022-04-15 17:49:43,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:43,445 INFO L225 Difference]: With dead ends: 418 [2022-04-15 17:49:43,445 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 17:49:43,446 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-15 17:49:43,446 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 581 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:43,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 219 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:49:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 17:49:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2022-04-15 17:49:43,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:43,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,751 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,751 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:43,756 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2022-04-15 17:49:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2022-04-15 17:49:43,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:43,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:43,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 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 283 states. [2022-04-15 17:49:43,758 INFO L87 Difference]: Start difference. First operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 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 283 states. [2022-04-15 17:49:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:43,764 INFO L93 Difference]: Finished difference Result 283 states and 427 transitions. [2022-04-15 17:49:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2022-04-15 17:49:43,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:43,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:43,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:43,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 276 states have internal predecessors, (422), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 426 transitions. [2022-04-15 17:49:43,770 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 426 transitions. Word has length 39 [2022-04-15 17:49:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:43,771 INFO L478 AbstractCegarLoop]: Abstraction has 281 states and 426 transitions. [2022-04-15 17:49:43,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:43,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 281 states and 426 transitions. [2022-04-15 17:49:44,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 426 transitions. [2022-04-15 17:49:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 17:49:44,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:44,093 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-15 17:49:44,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:49:44,093 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1772802082, now seen corresponding path program 1 times [2022-04-15 17:49:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033130070] [2022-04-15 17:49:44,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1772802082, now seen corresponding path program 2 times [2022-04-15 17:49:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301532893] [2022-04-15 17:49:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:44,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:44,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {7580#(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); {7574#true} is VALID [2022-04-15 17:49:44,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {7574#true} assume true; {7574#true} is VALID [2022-04-15 17:49:44,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7574#true} {7574#true} #674#return; {7574#true} is VALID [2022-04-15 17:49:44,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {7574#true} call ULTIMATE.init(); {7580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:44,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {7580#(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); {7574#true} is VALID [2022-04-15 17:49:44,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {7574#true} assume true; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7574#true} {7574#true} #674#return; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {7574#true} call #t~ret59 := main(); {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {7574#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L272 TraceCheckUtils]: 6: Hoare triple {7574#true} call #t~ret58 := ssl3_accept(~s~0); {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {7574#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {7574#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {7574#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {7574#true} assume !(0 != 12288 + ~tmp___1~0); {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {7574#true} assume !(0 == ~s__cert~0); {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {7574#true} assume !false; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {7574#true} ~state~0 := ~s__state~0; {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {7574#true} assume !(12292 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {7574#true} assume !(16384 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {7574#true} assume !(8192 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {7574#true} assume !(24576 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {7574#true} assume !(8195 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {7574#true} assume !(8480 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {7574#true} assume !(8481 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {7574#true} assume !(8482 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {7574#true} assume !(8464 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {7574#true} assume !(8465 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {7574#true} assume !(8466 == ~s__state~0); {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {7574#true} assume 8496 == ~s__state~0; {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {7574#true} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {7574#true} is VALID [2022-04-15 17:49:44,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {7574#true} assume !(1 == ~blastFlag~0); {7574#true} is VALID [2022-04-15 17:49:44,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {7574#true} assume !(~ret~0 <= 0); {7574#true} is VALID [2022-04-15 17:49:44,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {7574#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} ~s__init_num~0 := 0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 0 == ~s__s3__tmp__reuse_message~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 0 == ~skip~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 8528 == ~state~0; {7579#(<= 8656 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:49:44,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {7579#(<= 8656 ssl3_accept_~s__state~0)} assume 8544 == ~s__state~0; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {7575#false} assume 1024 != ~tmp___7~0; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {7575#false} assume 512 != ~tmp___7~0; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {7575#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {7575#false} assume 4294967266 != ~l~0 % 18446744073709551616; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {7575#false} assume !false; {7575#false} is VALID [2022-04-15 17:49:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:44,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:44,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301532893] [2022-04-15 17:49:44,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301532893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:44,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:44,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:44,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033130070] [2022-04-15 17:49:44,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033130070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:44,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:44,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:44,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221428342] [2022-04-15 17:49:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:44,157 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-15 17:49:44,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:44,157 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-15 17:49:44,180 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-15 17:49:44,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:44,180 INFO L87 Difference]: Start difference. First operand 281 states and 426 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-15 17:49:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:45,052 INFO L93 Difference]: Finished difference Result 662 states and 1032 transitions. [2022-04-15 17:49:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:45,052 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-15 17:49:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:45,052 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-15 17:49:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-04-15 17:49:45,055 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-15 17:49:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-04-15 17:49:45,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 525 transitions. [2022-04-15 17:49:45,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 525 edges. 525 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:45,329 INFO L225 Difference]: With dead ends: 662 [2022-04-15 17:49:45,329 INFO L226 Difference]: Without dead ends: 395 [2022-04-15 17:49:45,329 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-15 17:49:45,332 INFO L913 BasicCegarLoop]: 232 mSDtfsCounter, 302 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:45,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 239 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-15 17:49:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 367. [2022-04-15 17:49:45,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:45,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:45,632 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:45,640 INFO L93 Difference]: Finished difference Result 395 states and 570 transitions. [2022-04-15 17:49:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2022-04-15 17:49:45,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:45,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:45,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 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 395 states. [2022-04-15 17:49:45,641 INFO L87 Difference]: Start difference. First operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 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 395 states. [2022-04-15 17:49:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:45,649 INFO L93 Difference]: Finished difference Result 395 states and 570 transitions. [2022-04-15 17:49:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2022-04-15 17:49:45,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:45,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:45,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:45,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 362 states have internal predecessors, (526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 530 transitions. [2022-04-15 17:49:45,657 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 530 transitions. Word has length 41 [2022-04-15 17:49:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:45,657 INFO L478 AbstractCegarLoop]: Abstraction has 367 states and 530 transitions. [2022-04-15 17:49:45,658 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-15 17:49:45,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 530 transitions. [2022-04-15 17:49:46,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 530 edges. 530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 530 transitions. [2022-04-15 17:49:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 17:49:46,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:46,138 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-15 17:49:46,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:49:46,139 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2030967520, now seen corresponding path program 1 times [2022-04-15 17:49:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:46,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552868857] [2022-04-15 17:49:46,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2030967520, now seen corresponding path program 2 times [2022-04-15 17:49:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:46,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794602615] [2022-04-15 17:49:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:46,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {10440#(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); {10434#true} is VALID [2022-04-15 17:49:46,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-15 17:49:46,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10434#true} {10434#true} #674#return; {10434#true} is VALID [2022-04-15 17:49:46,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {10434#true} call ULTIMATE.init(); {10440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:46,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {10440#(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); {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10434#true} #674#return; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {10434#true} call #t~ret59 := main(); {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {10434#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L272 TraceCheckUtils]: 6: Hoare triple {10434#true} call #t~ret58 := ssl3_accept(~s~0); {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {10434#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {10434#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {10434#true} assume !(0 != 12288 + ~tmp___1~0); {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {10434#true} assume !(0 == ~s__cert~0); {10434#true} is VALID [2022-04-15 17:49:46,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {10434#true} assume !false; {10434#true} is VALID [2022-04-15 17:49:46,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {10434#true} ~state~0 := ~s__state~0; {10434#true} is VALID [2022-04-15 17:49:46,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {10434#true} assume !(12292 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} assume !(16384 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {10434#true} assume !(8192 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {10434#true} assume !(24576 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {10434#true} assume !(8195 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {10434#true} assume !(8480 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {10434#true} assume !(8481 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {10434#true} assume !(8482 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {10434#true} assume !(8464 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {10434#true} assume !(8465 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {10434#true} assume !(8466 == ~s__state~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {10434#true} assume 8496 == ~s__state~0; {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {10434#true} assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~ret~0 := #t~nondet37;havoc #t~nondet37; {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {10434#true} assume !(1 == ~blastFlag~0); {10434#true} is VALID [2022-04-15 17:49:46,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {10434#true} assume !(~ret~0 <= 0); {10434#true} is VALID [2022-04-15 17:49:46,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {10434#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} ~s__init_num~0 := 0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 0 == ~s__s3__tmp__reuse_message~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 0 == ~skip~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 8528 == ~state~0; {10439#(<= ssl3_accept_~s__state~0 8512)} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {10439#(<= ssl3_accept_~s__state~0 8512)} assume 8544 == ~s__state~0; {10435#false} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {10435#false} assume 1024 != ~tmp___7~0; {10435#false} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {10435#false} assume 512 != ~tmp___7~0; {10435#false} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {10435#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {10435#false} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {10435#false} assume 4294967266 != ~l~0 % 18446744073709551616; {10435#false} is VALID [2022-04-15 17:49:46,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-04-15 17:49:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:46,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:46,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794602615] [2022-04-15 17:49:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794602615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:46,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:46,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:46,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:46,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552868857] [2022-04-15 17:49:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552868857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:46,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:46,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:46,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971147960] [2022-04-15 17:49:46,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:46,215 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-15 17:49:46,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:46,215 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-15 17:49:46,235 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-15 17:49:46,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:46,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:46,236 INFO L87 Difference]: Start difference. First operand 367 states and 530 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-15 17:49:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:47,349 INFO L93 Difference]: Finished difference Result 850 states and 1263 transitions. [2022-04-15 17:49:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:47,349 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-15 17:49:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:47,350 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-15 17:49:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2022-04-15 17:49:47,352 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-15 17:49:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2022-04-15 17:49:47,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 532 transitions. [2022-04-15 17:49:47,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:47,683 INFO L225 Difference]: With dead ends: 850 [2022-04-15 17:49:47,683 INFO L226 Difference]: Without dead ends: 473 [2022-04-15 17:49:47,684 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-15 17:49:47,684 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 313 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:47,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 241 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-04-15 17:49:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 461. [2022-04-15 17:49:48,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:48,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:48,360 INFO L74 IsIncluded]: Start isIncluded. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:48,360 INFO L87 Difference]: Start difference. First operand 473 states. Second operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:48,372 INFO L93 Difference]: Finished difference Result 473 states and 679 transitions. [2022-04-15 17:49:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 679 transitions. [2022-04-15 17:49:48,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:48,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:48,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 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 473 states. [2022-04-15 17:49:48,374 INFO L87 Difference]: Start difference. First operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 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 473 states. [2022-04-15 17:49:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:48,384 INFO L93 Difference]: Finished difference Result 473 states and 679 transitions. [2022-04-15 17:49:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 679 transitions. [2022-04-15 17:49:48,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:48,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:48,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:48,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 664 transitions. [2022-04-15 17:49:48,396 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 664 transitions. Word has length 41 [2022-04-15 17:49:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:48,396 INFO L478 AbstractCegarLoop]: Abstraction has 461 states and 664 transitions. [2022-04-15 17:49:48,396 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-15 17:49:48,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 461 states and 664 transitions. [2022-04-15 17:49:48,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 664 edges. 664 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 664 transitions. [2022-04-15 17:49:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 17:49:48,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:48,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:48,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:49:48,935 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1025513814, now seen corresponding path program 1 times [2022-04-15 17:49:48,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121039088] [2022-04-15 17:49:48,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1025513814, now seen corresponding path program 2 times [2022-04-15 17:49:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626435392] [2022-04-15 17:49:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:48,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {14020#(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); {14014#true} is VALID [2022-04-15 17:49:48,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {14014#true} assume true; {14014#true} is VALID [2022-04-15 17:49:48,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14014#true} {14014#true} #674#return; {14014#true} is VALID [2022-04-15 17:49:48,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {14014#true} call ULTIMATE.init(); {14020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:48,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {14020#(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); {14014#true} is VALID [2022-04-15 17:49:48,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {14014#true} assume true; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14014#true} {14014#true} #674#return; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {14014#true} call #t~ret59 := main(); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {14014#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {14014#true} call #t~ret58 := ssl3_accept(~s~0); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {14014#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {14014#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {14014#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {14014#true} assume !(0 != 12288 + ~tmp___1~0); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {14014#true} assume !(0 == ~s__cert~0); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {14014#true} assume !false; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {14014#true} ~state~0 := ~s__state~0; {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {14014#true} assume !(12292 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {14014#true} assume !(16384 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {14014#true} assume !(8192 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {14014#true} assume !(24576 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {14014#true} assume !(8195 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {14014#true} assume !(8480 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {14014#true} assume !(8481 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {14014#true} assume !(8482 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {14014#true} assume !(8464 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {14014#true} assume !(8465 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {14014#true} assume !(8466 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {14014#true} assume !(8496 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {14014#true} assume !(8497 == ~s__state~0); {14014#true} is VALID [2022-04-15 17:49:48,993 INFO L290 TraceCheckUtils]: 27: Hoare triple {14014#true} assume 8512 == ~s__state~0; {14014#true} is VALID [2022-04-15 17:49:48,993 INFO L290 TraceCheckUtils]: 28: Hoare triple {14014#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {14014#true} is VALID [2022-04-15 17:49:48,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {14014#true} assume 0 != (256 + ~__cil_tmp56~0) % 18446744073709551616;~skip~0 := 1; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} ~s__state~0 := 8528;~s__init_num~0 := 0; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume 0 == ~s__s3__tmp__reuse_message~0; {14019#(= ssl3_accept_~skip~0 1)} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {14019#(= ssl3_accept_~skip~0 1)} assume 0 == ~skip~0; {14015#false} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {14015#false} assume 8528 == ~state~0; {14015#false} is VALID [2022-04-15 17:49:48,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#false} assume 8544 == ~s__state~0; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {14015#false} assume 1024 != ~tmp___7~0; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {14015#false} assume 512 != ~tmp___7~0; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {14015#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {14015#false} assume 4294967266 != ~l~0 % 18446744073709551616; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {14015#false} assume !false; {14015#false} is VALID [2022-04-15 17:49:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:48,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626435392] [2022-04-15 17:49:48,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626435392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:48,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:48,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:48,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:48,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121039088] [2022-04-15 17:49:48,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121039088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:48,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:48,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906370203] [2022-04-15 17:49:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:48,998 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-15 17:49:48,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:48,998 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-15 17:49:49,016 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-15 17:49:49,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:49,017 INFO L87 Difference]: Start difference. First operand 461 states and 664 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-15 17:49:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:50,047 INFO L93 Difference]: Finished difference Result 920 states and 1326 transitions. [2022-04-15 17:49:50,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:50,048 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-15 17:49:50,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:50,049 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-15 17:49:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-15 17:49:50,051 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-15 17:49:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-04-15 17:49:50,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-04-15 17:49:50,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:50,343 INFO L225 Difference]: With dead ends: 920 [2022-04-15 17:49:50,343 INFO L226 Difference]: Without dead ends: 473 [2022-04-15 17:49:50,344 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-15 17:49:50,345 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 221 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:50,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 233 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:49:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-04-15 17:49:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2022-04-15 17:49:51,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:51,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:51,049 INFO L74 IsIncluded]: Start isIncluded. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:51,050 INFO L87 Difference]: Start difference. First operand 473 states. Second operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:51,061 INFO L93 Difference]: Finished difference Result 473 states and 678 transitions. [2022-04-15 17:49:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 678 transitions. [2022-04-15 17:49:51,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:51,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:51,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 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 473 states. [2022-04-15 17:49:51,063 INFO L87 Difference]: Start difference. First operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 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 473 states. [2022-04-15 17:49:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:51,073 INFO L93 Difference]: Finished difference Result 473 states and 678 transitions. [2022-04-15 17:49:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 678 transitions. [2022-04-15 17:49:51,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:51,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:51,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:51,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 466 states have (on average 1.44206008583691) internal successors, (672), 466 states have internal predecessors, (672), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 676 transitions. [2022-04-15 17:49:51,088 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 676 transitions. Word has length 41 [2022-04-15 17:49:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:51,088 INFO L478 AbstractCegarLoop]: Abstraction has 471 states and 676 transitions. [2022-04-15 17:49:51,089 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-15 17:49:51,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 471 states and 676 transitions. [2022-04-15 17:49:51,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 676 edges. 676 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 676 transitions. [2022-04-15 17:49:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 17:49:51,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:51,646 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:49:51,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:49:51,646 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 564813646, now seen corresponding path program 1 times [2022-04-15 17:49:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:51,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1652315279] [2022-04-15 17:49:51,647 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash 564813646, now seen corresponding path program 2 times [2022-04-15 17:49:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:51,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935850024] [2022-04-15 17:49:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:51,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {17759#(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); {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {17753#true} assume true; {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17753#true} {17753#true} #674#return; {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {17753#true} call ULTIMATE.init(); {17759#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:51,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {17759#(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); {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {17753#true} assume true; {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17753#true} {17753#true} #674#return; {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {17753#true} call #t~ret59 := main(); {17753#true} is VALID [2022-04-15 17:49:51,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {17753#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {17753#true} call #t~ret58 := ssl3_accept(~s~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {17753#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {17753#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {17753#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {17753#true} assume !(0 != 12288 + ~tmp___1~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {17753#true} assume !(0 == ~s__cert~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {17753#true} assume !false; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {17753#true} ~state~0 := ~s__state~0; {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {17753#true} assume !(12292 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {17753#true} assume !(16384 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {17753#true} assume !(8192 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {17753#true} assume !(24576 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {17753#true} assume !(8195 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {17753#true} assume !(8480 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {17753#true} assume !(8481 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {17753#true} assume !(8482 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {17753#true} assume !(8464 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {17753#true} assume !(8465 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {17753#true} assume !(8466 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {17753#true} assume !(8496 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {17753#true} assume !(8497 == ~s__state~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {17753#true} assume 8512 == ~s__state~0; {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {17753#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet38;havoc #t~nondet38;~__cil_tmp56~0 := ~s__s3__tmp__new_cipher__algorithms~0; {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {17753#true} assume !(0 != (256 + ~__cil_tmp56~0) % 18446744073709551616);assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~ret~0 := #t~nondet39;havoc #t~nondet39; {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {17753#true} assume !(2 == ~blastFlag~0); {17753#true} is VALID [2022-04-15 17:49:51,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {17753#true} assume !(~ret~0 <= 0); {17753#true} is VALID [2022-04-15 17:49:51,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {17753#true} ~s__state~0 := 8528;~s__init_num~0 := 0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 17:49:51,726 INFO L290 TraceCheckUtils]: 33: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 17:49:51,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 0 == ~s__s3__tmp__reuse_message~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 17:49:51,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 0 == ~skip~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 17:49:51,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 8528 == ~state~0; {17758#(<= ssl3_accept_~s__state~0 8528)} is VALID [2022-04-15 17:49:51,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {17758#(<= ssl3_accept_~s__state~0 8528)} assume 8544 == ~s__state~0; {17754#false} is VALID [2022-04-15 17:49:51,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {17754#false} assume 1024 != ~tmp___7~0; {17754#false} is VALID [2022-04-15 17:49:51,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {17754#false} assume 512 != ~tmp___7~0; {17754#false} is VALID [2022-04-15 17:49:51,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {17754#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {17754#false} is VALID [2022-04-15 17:49:51,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {17754#false} assume 4294967266 != ~l~0 % 18446744073709551616; {17754#false} is VALID [2022-04-15 17:49:51,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {17754#false} assume !false; {17754#false} is VALID [2022-04-15 17:49:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935850024] [2022-04-15 17:49:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935850024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:51,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:51,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:51,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:51,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1652315279] [2022-04-15 17:49:51,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1652315279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:51,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:51,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707176385] [2022-04-15 17:49:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:51,729 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-15 17:49:51,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:51,729 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-15 17:49:51,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:51,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:51,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:51,753 INFO L87 Difference]: Start difference. First operand 471 states and 676 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-15 17:49:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:53,020 INFO L93 Difference]: Finished difference Result 1058 states and 1561 transitions. [2022-04-15 17:49:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:53,021 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-15 17:49:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:53,021 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-15 17:49:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-04-15 17:49:53,024 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-15 17:49:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-04-15 17:49:53,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 547 transitions. [2022-04-15 17:49:53,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:53,360 INFO L225 Difference]: With dead ends: 1058 [2022-04-15 17:49:53,360 INFO L226 Difference]: Without dead ends: 577 [2022-04-15 17:49:53,361 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-15 17:49:53,363 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 352 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:53,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 241 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:49:53,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-04-15 17:49:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 533. [2022-04-15 17:49:53,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:53,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:53,910 INFO L74 IsIncluded]: Start isIncluded. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:53,910 INFO L87 Difference]: Start difference. First operand 577 states. Second operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:53,939 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2022-04-15 17:49:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 837 transitions. [2022-04-15 17:49:53,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:53,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:53,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 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 577 states. [2022-04-15 17:49:53,942 INFO L87 Difference]: Start difference. First operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 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 577 states. [2022-04-15 17:49:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:53,973 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2022-04-15 17:49:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 837 transitions. [2022-04-15 17:49:53,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:53,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:53,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:53,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 528 states have (on average 1.4621212121212122) internal successors, (772), 528 states have internal predecessors, (772), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 776 transitions. [2022-04-15 17:49:54,003 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 776 transitions. Word has length 43 [2022-04-15 17:49:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:54,004 INFO L478 AbstractCegarLoop]: Abstraction has 533 states and 776 transitions. [2022-04-15 17:49:54,004 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-15 17:49:54,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 533 states and 776 transitions. [2022-04-15 17:49:54,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 776 transitions. [2022-04-15 17:49:54,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 17:49:54,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:54,665 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] [2022-04-15 17:49:54,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:49:54,665 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:54,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 924583977, now seen corresponding path program 1 times [2022-04-15 17:49:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868125748] [2022-04-15 17:49:54,666 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 924583977, now seen corresponding path program 2 times [2022-04-15 17:49:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441626811] [2022-04-15 17:49:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:54,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {22107#(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); {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {22101#true} assume true; {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22101#true} {22101#true} #674#return; {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {22101#true} call ULTIMATE.init(); {22107#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:54,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {22107#(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); {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {22101#true} assume true; {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22101#true} {22101#true} #674#return; {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {22101#true} call #t~ret59 := main(); {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {22101#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {22101#true} is VALID [2022-04-15 17:49:54,714 INFO L272 TraceCheckUtils]: 6: Hoare triple {22101#true} call #t~ret58 := ssl3_accept(~s~0); {22101#true} is VALID [2022-04-15 17:49:54,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {22101#true} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {22101#true} is VALID [2022-04-15 17:49:54,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {22101#true} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {22101#true} is VALID [2022-04-15 17:49:54,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {22101#true} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {22101#true} is VALID [2022-04-15 17:49:54,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {22101#true} assume !(0 != 12288 + ~tmp___1~0); {22101#true} is VALID [2022-04-15 17:49:54,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {22101#true} assume !(0 == ~s__cert~0); {22101#true} is VALID [2022-04-15 17:49:54,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {22101#true} assume !false; {22101#true} is VALID [2022-04-15 17:49:54,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {22101#true} ~state~0 := ~s__state~0; {22101#true} is VALID [2022-04-15 17:49:54,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {22101#true} assume !(12292 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {22101#true} assume !(16384 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {22101#true} assume !(8192 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {22101#true} assume !(24576 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {22101#true} assume !(8195 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {22101#true} assume !(8480 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {22101#true} assume !(8481 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {22101#true} assume !(8482 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {22101#true} assume !(8464 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {22101#true} assume !(8465 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {22101#true} assume !(8466 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {22101#true} assume !(8496 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {22101#true} assume !(8497 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {22101#true} assume !(8512 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {22101#true} assume !(8513 == ~s__state~0); {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {22101#true} assume 8528 == ~s__state~0; {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {22101#true} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {22101#true} is VALID [2022-04-15 17:49:54,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {22101#true} assume !(0 != (2097152 + ~__cil_tmp57~0) % 18446744073709551616);~s__s3__tmp__use_rsa_tmp~0 := 0; {22106#(= ssl3_accept_~s__s3__tmp__use_rsa_tmp~0 0)} is VALID [2022-04-15 17:49:54,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {22106#(= ssl3_accept_~s__s3__tmp__use_rsa_tmp~0 0)} assume 0 != ~s__s3__tmp__use_rsa_tmp~0; {22102#false} is VALID [2022-04-15 17:49:54,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {22102#false} assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~ret~0 := #t~nondet43;havoc #t~nondet43; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {22102#false} assume !(6 == ~blastFlag~0); {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {22102#false} assume !(~ret~0 <= 0); {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {22102#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {22102#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {22102#false} assume 0 == ~s__s3__tmp__reuse_message~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {22102#false} assume 0 == ~skip~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {22102#false} assume 8528 == ~state~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {22102#false} assume 8544 == ~s__state~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {22102#false} assume 1024 != ~tmp___7~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {22102#false} assume 512 != ~tmp___7~0; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {22102#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {22102#false} assume 4294967266 != ~l~0 % 18446744073709551616; {22102#false} is VALID [2022-04-15 17:49:54,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {22102#false} assume !false; {22102#false} is VALID [2022-04-15 17:49:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441626811] [2022-04-15 17:49:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441626811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:54,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:54,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:54,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868125748] [2022-04-15 17:49:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868125748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:54,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:54,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 17:49:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084264336] [2022-04-15 17:49:54,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 47 [2022-04-15 17:49:54,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:54,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:54,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:54,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 17:49:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 17:49:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 17:49:54,749 INFO L87 Difference]: Start difference. First operand 533 states and 776 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:56,183 INFO L93 Difference]: Finished difference Result 1555 states and 2264 transitions. [2022-04-15 17:49:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 17:49:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 47 [2022-04-15 17:49:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-15 17:49:56,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2022-04-15 17:49:56,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 617 transitions. [2022-04-15 17:49:56,611 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-15 17:49:56,650 INFO L225 Difference]: With dead ends: 1555 [2022-04-15 17:49:56,651 INFO L226 Difference]: Without dead ends: 1036 [2022-04-15 17:49:56,651 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-15 17:49:56,652 INFO L913 BasicCegarLoop]: 409 mSDtfsCounter, 419 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:49:56,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 416 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:49:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-04-15 17:49:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 535. [2022-04-15 17:49:57,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:49:57,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:57,325 INFO L74 IsIncluded]: Start isIncluded. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:57,326 INFO L87 Difference]: Start difference. First operand 1036 states. Second operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:57,359 INFO L93 Difference]: Finished difference Result 1036 states and 1504 transitions. [2022-04-15 17:49:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1504 transitions. [2022-04-15 17:49:57,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:57,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:57,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 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 1036 states. [2022-04-15 17:49:57,362 INFO L87 Difference]: Start difference. First operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 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 1036 states. [2022-04-15 17:49:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:57,396 INFO L93 Difference]: Finished difference Result 1036 states and 1504 transitions. [2022-04-15 17:49:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1504 transitions. [2022-04-15 17:49:57,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:49:57,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:49:57,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:49:57,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:49:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 530 states have (on average 1.460377358490566) internal successors, (774), 530 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 778 transitions. [2022-04-15 17:49:57,413 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 778 transitions. Word has length 47 [2022-04-15 17:49:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:49:57,413 INFO L478 AbstractCegarLoop]: Abstraction has 535 states and 778 transitions. [2022-04-15 17:49:57,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:57,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 535 states and 778 transitions. [2022-04-15 17:49:58,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 778 transitions. [2022-04-15 17:49:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 17:49:58,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:49:58,190 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] [2022-04-15 17:49:58,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:49:58,190 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:49:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:49:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1945652331, now seen corresponding path program 1 times [2022-04-15 17:49:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:58,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486229895] [2022-04-15 17:49:58,191 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:49:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1945652331, now seen corresponding path program 2 times [2022-04-15 17:49:58,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:49:58,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037025017] [2022-04-15 17:49:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:49:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:49:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:49:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:49:58,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {28373#(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); {28365#true} is VALID [2022-04-15 17:49:58,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {28365#true} assume true; {28365#true} is VALID [2022-04-15 17:49:58,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28365#true} {28365#true} #674#return; {28365#true} is VALID [2022-04-15 17:49:58,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {28365#true} call ULTIMATE.init(); {28373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:49:58,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {28373#(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); {28365#true} is VALID [2022-04-15 17:49:58,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {28365#true} assume true; {28365#true} is VALID [2022-04-15 17:49:58,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28365#true} {28365#true} #674#return; {28365#true} is VALID [2022-04-15 17:49:58,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {28365#true} call #t~ret59 := main(); {28365#true} is VALID [2022-04-15 17:49:58,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {28365#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {28370#(<= main_~s~0 8464)} is VALID [2022-04-15 17:49:58,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {28370#(<= main_~s~0 8464)} call #t~ret58 := ssl3_accept(~s~0); {28371#(<= |ssl3_accept_#in~initial_state| 8464)} is VALID [2022-04-15 17:49:58,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {28371#(<= |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;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(0 != 12288 + ~tmp___1~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(0 == ~s__cert~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !false; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} ~state~0 := ~s__state~0; {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(12292 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(16384 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8192 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(24576 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8195 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8480 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8481 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8482 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8464 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8465 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8466 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8496 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8497 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8512 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume !(8513 == ~s__state~0); {28372#(<= ssl3_accept_~s__state~0 8464)} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {28372#(<= ssl3_accept_~s__state~0 8464)} assume 8528 == ~s__state~0; {28366#false} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {28366#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {28366#false} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {28366#false} assume 0 != (2097152 + ~__cil_tmp57~0) % 18446744073709551616;~s__s3__tmp__use_rsa_tmp~0 := 1; {28366#false} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {28366#false} assume 0 != ~s__s3__tmp__use_rsa_tmp~0; {28366#false} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {28366#false} assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~ret~0 := #t~nondet43;havoc #t~nondet43; {28366#false} is VALID [2022-04-15 17:49:58,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {28366#false} assume !(6 == ~blastFlag~0); {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {28366#false} assume !(~ret~0 <= 0); {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {28366#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {28366#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {28366#false} assume 0 == ~s__s3__tmp__reuse_message~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {28366#false} assume 0 == ~skip~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {28366#false} assume 8528 == ~state~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {28366#false} assume 8544 == ~s__state~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 42: Hoare triple {28366#false} assume 1024 != ~tmp___7~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {28366#false} assume 512 != ~tmp___7~0; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {28366#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {28366#false} assume 4294967266 != ~l~0 % 18446744073709551616; {28366#false} is VALID [2022-04-15 17:49:58,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {28366#false} assume !false; {28366#false} is VALID [2022-04-15 17:49:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 17:49:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:49:58,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037025017] [2022-04-15 17:49:58,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037025017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:58,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:58,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:58,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:49:58,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486229895] [2022-04-15 17:49:58,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486229895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:49:58,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:49:58,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:49:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387721304] [2022-04-15 17:49:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:49:58,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-15 17:49:58,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:49:58,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:58,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:49:58,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:49:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:49:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:49:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:49:58,335 INFO L87 Difference]: Start difference. First operand 535 states and 778 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:49:59,933 INFO L93 Difference]: Finished difference Result 1175 states and 1726 transitions. [2022-04-15 17:49:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:49:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-15 17:49:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:49:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-04-15 17:49:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:49:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-04-15 17:49:59,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 526 transitions. [2022-04-15 17:50:00,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 526 edges. 526 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:00,189 INFO L225 Difference]: With dead ends: 1175 [2022-04-15 17:50:00,189 INFO L226 Difference]: Without dead ends: 642 [2022-04-15 17:50:00,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 17:50:00,190 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 630 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:00,191 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 198 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:50:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-04-15 17:50:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 595. [2022-04-15 17:50:00,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:00,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:00,935 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:00,935 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:00,959 INFO L93 Difference]: Finished difference Result 642 states and 911 transitions. [2022-04-15 17:50:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2022-04-15 17:50:00,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:00,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:00,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 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 642 states. [2022-04-15 17:50:00,961 INFO L87 Difference]: Start difference. First operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 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 642 states. [2022-04-15 17:50:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:00,975 INFO L93 Difference]: Finished difference Result 642 states and 911 transitions. [2022-04-15 17:50:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 911 transitions. [2022-04-15 17:50:00,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:00,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:00,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:00,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 590 states have (on average 1.4508474576271186) internal successors, (856), 590 states have internal predecessors, (856), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 860 transitions. [2022-04-15 17:50:00,994 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 860 transitions. Word has length 47 [2022-04-15 17:50:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:00,994 INFO L478 AbstractCegarLoop]: Abstraction has 595 states and 860 transitions. [2022-04-15 17:50:00,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:00,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 595 states and 860 transitions. [2022-04-15 17:50:01,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 860 edges. 860 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 860 transitions. [2022-04-15 17:50:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 17:50:01,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:01,724 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:01,724 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:50:01,724 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:01,724 INFO L85 PathProgramCache]: Analyzing trace with hash 427057800, now seen corresponding path program 1 times [2022-04-15 17:50:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006565597] [2022-04-15 17:50:13,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 17:50:13,377 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 17:50:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash 427057800, now seen corresponding path program 2 times [2022-04-15 17:50:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:50:13,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355548396] [2022-04-15 17:50:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:50:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:50:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:50:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:50:13,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {33214#(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); {33206#true} is VALID [2022-04-15 17:50:13,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {33206#true} assume true; {33206#true} is VALID [2022-04-15 17:50:13,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33206#true} {33206#true} #674#return; {33206#true} is VALID [2022-04-15 17:50:13,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {33206#true} call ULTIMATE.init(); {33214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:50:13,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {33214#(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); {33206#true} is VALID [2022-04-15 17:50:13,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {33206#true} assume true; {33206#true} is VALID [2022-04-15 17:50:13,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33206#true} {33206#true} #674#return; {33206#true} is VALID [2022-04-15 17:50:13,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {33206#true} call #t~ret59 := main(); {33206#true} is VALID [2022-04-15 17:50:13,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {33206#true} havoc ~s~0;havoc ~tmp~1;~s~0 := 8464; {33211#(<= 8464 main_~s~0)} is VALID [2022-04-15 17:50:13,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {33211#(<= 8464 main_~s~0)} call #t~ret58 := ssl3_accept(~s~0); {33212#(<= 8464 |ssl3_accept_#in~initial_state|)} is VALID [2022-04-15 17:50:13,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {33212#(<= 8464 |ssl3_accept_#in~initial_state|)} ~initial_state := #in~initial_state;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__info_callback~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__in_handshake~0 := #t~nondet5;havoc #t~nondet5;havoc ~s__state~0;havoc ~s__new_session~0;havoc ~s__server~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__version~0 := #t~nondet6;havoc #t~nondet6;havoc ~s__type~0;havoc ~s__init_num~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__hit~0 := #t~nondet7;havoc #t~nondet7;havoc ~s__rwstate~0;~s__init_buf___0~0 := 1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~s__debug~0 := #t~nondet8;havoc #t~nondet8;havoc ~s__shutdown~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~s__cert~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~s__options~0 := #t~nondet10;havoc #t~nondet10;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~s__verify_mode~0 := #t~nondet11;havoc #t~nondet11;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~s__session__peer~0 := #t~nondet12;havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~s__cert__pkeys__AT0__privatekey~0 := #t~nondet13;havoc #t~nondet13;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~s__ctx__info_callback~0 := #t~nondet14;havoc #t~nondet14;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~s__ctx__stats__sess_accept_renegotiate~0 := #t~nondet15;havoc #t~nondet15;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~s__ctx__stats__sess_accept~0 := #t~nondet16;havoc #t~nondet16;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~s__ctx__stats__sess_accept_good~0 := #t~nondet17;havoc #t~nondet17;havoc ~s__s3__tmp__cert_request~0;havoc ~s__s3__tmp__reuse_message~0;havoc ~s__s3__tmp__use_rsa_tmp~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~s__s3__tmp__new_cipher~0 := #t~nondet18;havoc #t~nondet18;havoc ~s__s3__tmp__new_cipher__algorithms~0;havoc ~s__s3__tmp__next_state___0~0;havoc ~s__s3__tmp__new_cipher__algo_strength~0;havoc ~s__session__cipher~0;havoc ~buf~0;havoc ~l~0;havoc ~Time~0;havoc ~tmp~0;havoc ~cb~0;assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;~num1~0 := #t~nondet19;havoc #t~nondet19;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet20 && #t~nondet20 <= 2147483647;~tmp___1~0 := #t~nondet20;havoc #t~nondet20;assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp___2~0 := #t~nondet21;havoc #t~nondet21;assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___3~0 := #t~nondet22;havoc #t~nondet22;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___4~0 := #t~nondet23;havoc #t~nondet23;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~tmp___5~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~tmp___6~0 := #t~nondet25;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp___7~0 := #t~nondet26;havoc #t~nondet26;assume -9223372036854775808 <= #t~nondet27 && #t~nondet27 <= 9223372036854775807;~tmp___8~0 := #t~nondet27;havoc #t~nondet27;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp___9~0 := #t~nondet28;havoc #t~nondet28;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp___10~0 := #t~nondet29;havoc #t~nondet29;havoc ~blastFlag~0;havoc ~__cil_tmp55~0;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;~s__state~0 := ~initial_state;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp~0 := #t~nondet30;havoc #t~nondet30;~Time~0 := ~tmp~0;~cb~0 := 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0; {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume 0 != ~s__info_callback~0;~cb~0 := ~s__info_callback~0; {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} #t~post31 := ~s__in_handshake~0;~s__in_handshake~0 := 1 + #t~post31;havoc #t~post31; {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(0 != 12288 + ~tmp___1~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(0 == ~s__cert~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !false; {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} ~state~0 := ~s__state~0; {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(12292 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(16384 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8192 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(24576 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8195 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8480 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8481 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8482 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8464 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8465 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8466 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8496 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8497 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8512 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8513 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8528 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8529 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8544 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8545 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8560 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume !(8561 == ~s__state~0); {33213#(<= 8464 ssl3_accept_~s__state~0)} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {33213#(<= 8464 ssl3_accept_~s__state~0)} assume 8448 == ~s__state~0; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {33207#false} assume !(~num1~0 > 0); {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {33207#false} ~s__state~0 := ~s__s3__tmp__next_state___0~0; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {33207#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {33207#false} assume !(0 == ~s__s3__tmp__reuse_message~0); {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {33207#false} ~skip~0 := 0; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {33207#false} assume !false; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {33207#false} ~state~0 := ~s__state~0; {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {33207#false} assume !(12292 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {33207#false} assume !(16384 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {33207#false} assume !(8192 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {33207#false} assume !(24576 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {33207#false} assume !(8195 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {33207#false} assume !(8480 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {33207#false} assume !(8481 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {33207#false} assume !(8482 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {33207#false} assume !(8464 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 52: Hoare triple {33207#false} assume !(8465 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 53: Hoare triple {33207#false} assume !(8466 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 54: Hoare triple {33207#false} assume !(8496 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 55: Hoare triple {33207#false} assume !(8497 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {33207#false} assume !(8512 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {33207#false} assume !(8513 == ~s__state~0); {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {33207#false} assume 8528 == ~s__state~0; {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {33207#false} assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet40;havoc #t~nondet40;~l~0 := ~s__s3__tmp__new_cipher__algorithms~0;~__cil_tmp57~0 := ~s__options~0; {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {33207#false} assume 0 != (2097152 + ~__cil_tmp57~0) % 18446744073709551616;~s__s3__tmp__use_rsa_tmp~0 := 1; {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {33207#false} assume 0 != ~s__s3__tmp__use_rsa_tmp~0; {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {33207#false} assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~ret~0 := #t~nondet43;havoc #t~nondet43; {33207#false} is VALID [2022-04-15 17:50:13,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {33207#false} assume !(6 == ~blastFlag~0); {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 64: Hoare triple {33207#false} assume !(~ret~0 <= 0); {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {33207#false} ~s__state~0 := 8544;~s__init_num~0 := 0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {33207#false} assume -2147483648 <= #t~nondet55 && #t~nondet55 <= 2147483647;~s__s3__tmp__reuse_message~0 := #t~nondet55;havoc #t~nondet55; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 67: Hoare triple {33207#false} assume 0 == ~s__s3__tmp__reuse_message~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {33207#false} assume 0 == ~skip~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 69: Hoare triple {33207#false} assume 8528 == ~state~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {33207#false} assume 8544 == ~s__state~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {33207#false} assume 1024 != ~tmp___7~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 72: Hoare triple {33207#false} assume 512 != ~tmp___7~0; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 73: Hoare triple {33207#false} assume 4294967294 != ~__cil_tmp58~0 % 18446744073709551616; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 74: Hoare triple {33207#false} assume 4294967266 != ~l~0 % 18446744073709551616; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L290 TraceCheckUtils]: 75: Hoare triple {33207#false} assume !false; {33207#false} is VALID [2022-04-15 17:50:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 17:50:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:50:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355548396] [2022-04-15 17:50:13,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355548396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:13,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:13,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:50:13,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:50:13,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006565597] [2022-04-15 17:50:13,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006565597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:50:13,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:50:13,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:50:13,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018631252] [2022-04-15 17:50:13,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:50:13,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 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 76 [2022-04-15 17:50:13,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:50:13,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:13,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:13,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:50:13,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:50:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:50:13,494 INFO L87 Difference]: Start difference. First operand 595 states and 860 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:14,739 INFO L93 Difference]: Finished difference Result 988 states and 1434 transitions. [2022-04-15 17:50:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:50:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 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 76 [2022-04-15 17:50:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:50:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:50:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 522 transitions. [2022-04-15 17:50:14,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 522 transitions. [2022-04-15 17:50:15,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:15,119 INFO L225 Difference]: With dead ends: 988 [2022-04-15 17:50:15,119 INFO L226 Difference]: Without dead ends: 381 [2022-04-15 17:50:15,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 17:50:15,120 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 706 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:50:15,120 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 193 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:50:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-04-15 17:50:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 368. [2022-04-15 17:50:15,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:50:15,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 381 states. Second operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:15,875 INFO L74 IsIncluded]: Start isIncluded. First operand 381 states. Second operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:15,876 INFO L87 Difference]: Start difference. First operand 381 states. Second operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:15,882 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2022-04-15 17:50:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 551 transitions. [2022-04-15 17:50:15,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:15,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:15,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 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 381 states. [2022-04-15 17:50:15,883 INFO L87 Difference]: Start difference. First operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 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 381 states. [2022-04-15 17:50:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:50:15,889 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2022-04-15 17:50:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 551 transitions. [2022-04-15 17:50:15,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:50:15,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:50:15,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:50:15,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:50:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 363 states have (on average 1.440771349862259) internal successors, (523), 363 states have internal predecessors, (523), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 527 transitions. [2022-04-15 17:50:15,897 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 527 transitions. Word has length 76 [2022-04-15 17:50:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:50:15,897 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 527 transitions. [2022-04-15 17:50:15,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 17:50:15,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 368 states and 527 transitions. [2022-04-15 17:50:16,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:50:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 527 transitions. [2022-04-15 17:50:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 17:50:16,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:50:16,422 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:50:16,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:50:16,422 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:50:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:50:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 577934568, now seen corresponding path program 1 times [2022-04-15 17:50:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:50:16,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042726673]