/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:39:11,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:39:11,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:39:11,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:39:11,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:39:11,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:39:11,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:39:11,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:39:11,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:39:11,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:39:11,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:39:11,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:39:11,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:39:11,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:39:11,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:39:11,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:39:11,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:39:11,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:39:11,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:39:11,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:39:11,439 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:39:11,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:39:11,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:39:11,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:39:11,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:39:11,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:39:11,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:39:11,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:39:11,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:39:11,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:39:11,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:39:11,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:39:11,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:39:11,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:39:11,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:39:11,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:39:11,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:39:11,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:39:11,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:39:11,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:39:11,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:39:11,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:39:11,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:39:11,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:39:11,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:39:11,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:39:11,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:39:11,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:39:11,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:39:11,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:39:11,470 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:39:11,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:39:11,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:39:11,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:39:11,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:39:11,635 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:39:11,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-28 08:39:11,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d2c7fb3/3f0754c3045141a196918b08785b327a/FLAGdef175746 [2022-04-28 08:39:12,096 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:39:12,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-28 08:39:12,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d2c7fb3/3f0754c3045141a196918b08785b327a/FLAGdef175746 [2022-04-28 08:39:12,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39d2c7fb3/3f0754c3045141a196918b08785b327a [2022-04-28 08:39:12,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:39:12,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:39:12,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:39:12,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:39:12,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:39:12,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45118853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12, skipping insertion in model container [2022-04-28 08:39:12,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:39:12,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:39:12,480 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/s3_srvr.blast.07.i.cil-2.c[74369,74382] [2022-04-28 08:39:12,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:39:12,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:39:12,565 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/s3_srvr.blast.07.i.cil-2.c[74369,74382] [2022-04-28 08:39:12,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:39:12,578 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:39:12,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12 WrapperNode [2022-04-28 08:39:12,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:39:12,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:39:12,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:39:12,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:39:12,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:39:12,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:39:12,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:39:12,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:39:12,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (1/1) ... [2022-04-28 08:39:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:39:12,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:39:12,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:39:12,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:39:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:39:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:39:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:39:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:39:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:39:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:39:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:39:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:39:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:39:12,738 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:39:12,738 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:39:12,740 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:39:12,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:39:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:39:12,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:39:12,905 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:39:12,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:39:13,669 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:39:14,165 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:39:14,165 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:39:14,174 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:39:14,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:39:14,184 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:39:14,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:39:14 BoogieIcfgContainer [2022-04-28 08:39:14,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:39:14,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:39:14,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:39:14,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:39:14,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:39:12" (1/3) ... [2022-04-28 08:39:14,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ffcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:39:14, skipping insertion in model container [2022-04-28 08:39:14,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:39:12" (2/3) ... [2022-04-28 08:39:14,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442ffcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:39:14, skipping insertion in model container [2022-04-28 08:39:14,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:39:14" (3/3) ... [2022-04-28 08:39:14,192 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2022-04-28 08:39:14,204 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:39:14,204 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:39:14,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:39:14,253 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ceb15cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@612af167 [2022-04-28 08:39:14,253 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:39:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:39:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 08:39:14,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:14,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:14,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-28 08:39:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:14,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580417039] [2022-04-28 08:39:14,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:39:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-28 08:39:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:14,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291088307] [2022-04-28 08:39:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:14,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:14,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 08:39:14,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:39:14,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 08:39:14,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:14,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 08:39:14,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 08:39:14,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 08:39:14,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 08:39:14,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-28 08:39:14,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-28 08:39:14,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-28 08:39:14,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:14,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 08:39:14,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-28 08:39:14,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-28 08:39:14,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {162#false} is VALID [2022-04-28 08:39:14,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-28 08:39:14,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {162#false} is VALID [2022-04-28 08:39:14,751 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-28 08:39:14,752 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-28 08:39:14,752 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 08:39:14,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 08:39:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:14,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291088307] [2022-04-28 08:39:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291088307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:14,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:14,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:14,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:14,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580417039] [2022-04-28 08:39:14,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580417039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:14,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:14,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:14,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082485567] [2022-04-28 08:39:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 08:39:14,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:14,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:14,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:14,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:14,838 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:20,611 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-28 08:39:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:20,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 08:39:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 08:39:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 08:39:20,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-28 08:39:21,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 723 edges. 723 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:21,128 INFO L225 Difference]: With dead ends: 428 [2022-04-28 08:39:21,128 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 08:39:21,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:21,133 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:21,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 08:39:21,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-28 08:39:21,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:21,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:21,164 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:21,164 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:21,172 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 08:39:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 08:39:21,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:21,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:21,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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 259 states. [2022-04-28 08:39:21,175 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 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 259 states. [2022-04-28 08:39:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:21,183 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 08:39:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 08:39:21,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:21,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:21,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:21,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 08:39:21,190 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 08:39:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:21,191 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 08:39:21,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:21,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 08:39:21,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 08:39:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 08:39:21,375 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:21,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:21,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:39:21,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-28 08:39:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30876048] [2022-04-28 08:39:21,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:39:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-28 08:39:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:21,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271271200] [2022-04-28 08:39:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:21,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1887#true} is VALID [2022-04-28 08:39:21,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 08:39:21,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 08:39:21,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {1887#true} call ULTIMATE.init(); {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:21,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1887#true} is VALID [2022-04-28 08:39:21,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 08:39:21,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 08:39:21,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1887#true} call #t~ret161 := main(); {1887#true} is VALID [2022-04-28 08:39:21,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1887#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1887#true} is VALID [2022-04-28 08:39:21,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1887#true} is VALID [2022-04-28 08:39:21,582 INFO L272 TraceCheckUtils]: 7: Hoare triple {1887#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1887#true} is VALID [2022-04-28 08:39:21,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {1887#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:21,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1893#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 08:39:21,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {1893#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1888#false} is VALID [2022-04-28 08:39:21,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {1888#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1888#false} is VALID [2022-04-28 08:39:21,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {1888#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {1888#false} is VALID [2022-04-28 08:39:21,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {1888#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1888#false} is VALID [2022-04-28 08:39:21,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {1888#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {1888#false} is VALID [2022-04-28 08:39:21,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {1888#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1888#false} is VALID [2022-04-28 08:39:21,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {1888#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1888#false} is VALID [2022-04-28 08:39:21,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {1888#false} assume 8 == ~blastFlag~0; {1888#false} is VALID [2022-04-28 08:39:21,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-04-28 08:39:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:21,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:21,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271271200] [2022-04-28 08:39:21,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271271200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:21,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:21,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:21,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30876048] [2022-04-28 08:39:21,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30876048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:21,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:21,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071174947] [2022-04-28 08:39:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:21,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:21,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:21,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:21,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:21,634 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:25,063 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:39:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:26,176 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-28 08:39:26,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:26,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:39:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:39:26,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:39:26,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:26,571 INFO L225 Difference]: With dead ends: 442 [2022-04-28 08:39:26,571 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 08:39:26,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:26,573 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:26,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 08:39:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 08:39:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-28 08:39:26,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:26,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:26,585 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:26,585 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:26,597 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 08:39:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 08:39:26,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:26,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:26,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 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 287 states. [2022-04-28 08:39:26,599 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 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 287 states. [2022-04-28 08:39:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:26,611 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 08:39:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 08:39:26,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:26,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:26,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:26,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 08:39:26,618 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 08:39:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:26,618 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 08:39:26,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 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-28 08:39:26,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 08:39:26,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 08:39:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 08:39:26,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:26,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:26,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:39:26,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-28 08:39:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805726184] [2022-04-28 08:39:26,821 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:39:26,821 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-28 08:39:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084781886] [2022-04-28 08:39:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:26,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3755#true} is VALID [2022-04-28 08:39:26,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 08:39:26,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 08:39:26,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {3755#true} call ULTIMATE.init(); {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:26,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {3762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3755#true} is VALID [2022-04-28 08:39:26,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 08:39:27,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 08:39:27,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {3755#true} call #t~ret161 := main(); {3755#true} is VALID [2022-04-28 08:39:27,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {3755#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3755#true} is VALID [2022-04-28 08:39:27,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {3755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3755#true} is VALID [2022-04-28 08:39:27,000 INFO L272 TraceCheckUtils]: 7: Hoare triple {3755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3755#true} is VALID [2022-04-28 08:39:27,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3755#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:27,027 INFO L290 TraceCheckUtils]: 43: Hoare triple {3760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 08:39:27,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {3761#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3756#false} is VALID [2022-04-28 08:39:27,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {3756#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3756#false} is VALID [2022-04-28 08:39:27,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#false} assume 4 == ~blastFlag~0; {3756#false} is VALID [2022-04-28 08:39:27,028 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#false} assume !false; {3756#false} is VALID [2022-04-28 08:39:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084781886] [2022-04-28 08:39:27,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084781886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:27,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:27,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805726184] [2022-04-28 08:39:27,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805726184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945110940] [2022-04-28 08:39:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:27,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 08:39:27,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:27,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:27,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:27,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:27,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:27,066 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:32,518 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-28 08:39:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 08:39:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:39:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:39:32,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:39:32,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:32,903 INFO L225 Difference]: With dead ends: 501 [2022-04-28 08:39:32,903 INFO L226 Difference]: Without dead ends: 317 [2022-04-28 08:39:32,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:32,911 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:32,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 08:39:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-28 08:39:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-28 08:39:32,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:32,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,922 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,922 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:32,927 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 08:39:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 08:39:32,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:32,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:32,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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 317 states. [2022-04-28 08:39:32,929 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 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 317 states. [2022-04-28 08:39:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:32,935 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 08:39:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 08:39:32,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:32,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:32,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:32,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 08:39:32,941 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 08:39:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:32,941 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 08:39:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:32,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 08:39:33,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 08:39:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 08:39:33,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:33,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:33,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:39:33,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-28 08:39:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:33,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590087144] [2022-04-28 08:39:33,190 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:39:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-28 08:39:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:33,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013335144] [2022-04-28 08:39:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:33,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:33,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:33,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5881#true} is VALID [2022-04-28 08:39:33,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 08:39:33,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 08:39:33,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {5881#true} call ULTIMATE.init(); {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:33,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {5888#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {5881#true} call #t~ret161 := main(); {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {5881#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {5881#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5881#true} is VALID [2022-04-28 08:39:33,339 INFO L272 TraceCheckUtils]: 7: Hoare triple {5881#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5881#true} is VALID [2022-04-28 08:39:33,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {5881#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,360 INFO L290 TraceCheckUtils]: 31: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:33,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {5886#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5887#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 08:39:33,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {5887#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {5882#false} is VALID [2022-04-28 08:39:33,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {5882#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5882#false} is VALID [2022-04-28 08:39:33,365 INFO L290 TraceCheckUtils]: 47: Hoare triple {5882#false} assume 4 == ~blastFlag~0; {5882#false} is VALID [2022-04-28 08:39:33,365 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#false} assume !false; {5882#false} is VALID [2022-04-28 08:39:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013335144] [2022-04-28 08:39:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013335144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:33,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:33,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:33,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:33,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590087144] [2022-04-28 08:39:33,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590087144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:33,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:33,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614533166] [2022-04-28 08:39:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:33,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-28 08:39:33,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:33,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:33,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:33,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:33,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:33,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:33,403 INFO L87 Difference]: Start difference. First operand 239 states and 388 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:39,119 INFO L93 Difference]: Finished difference Result 551 states and 886 transitions. [2022-04-28 08:39:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 49 [2022-04-28 08:39:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 08:39:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 08:39:39,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-28 08:39:39,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:39,523 INFO L225 Difference]: With dead ends: 551 [2022-04-28 08:39:39,523 INFO L226 Difference]: Without dead ends: 327 [2022-04-28 08:39:39,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:39,524 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 118 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:39,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 08:39:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-04-28 08:39:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 250. [2022-04-28 08:39:39,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:39,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,534 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,534 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:39,539 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-28 08:39:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-28 08:39:39,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:39,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:39,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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 327 states. [2022-04-28 08:39:39,541 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 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 327 states. [2022-04-28 08:39:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:39,546 INFO L93 Difference]: Finished difference Result 327 states and 516 transitions. [2022-04-28 08:39:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 516 transitions. [2022-04-28 08:39:39,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:39,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:39,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:39,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-28 08:39:39,551 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-28 08:39:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:39,551 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-28 08:39:39,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:39,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 409 transitions. [2022-04-28 08:39:39,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-28 08:39:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 08:39:39,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:39,823 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-28 08:39:39,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:39:39,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:39,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 1 times [2022-04-28 08:39:39,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:39,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1671413127] [2022-04-28 08:39:39,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:39:39,904 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:39:39,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 2 times [2022-04-28 08:39:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387422628] [2022-04-28 08:39:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:40,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8149#true} is VALID [2022-04-28 08:39:40,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {8149#true} assume true; {8149#true} is VALID [2022-04-28 08:39:40,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8149#true} {8149#true} #689#return; {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {8149#true} call ULTIMATE.init(); {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:40,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {8156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {8149#true} assume true; {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8149#true} {8149#true} #689#return; {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {8149#true} call #t~ret161 := main(); {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {8149#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {8149#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8149#true} is VALID [2022-04-28 08:39:40,031 INFO L272 TraceCheckUtils]: 7: Hoare triple {8149#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8149#true} is VALID [2022-04-28 08:39:40,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {8149#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,044 INFO L290 TraceCheckUtils]: 29: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:40,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {8154#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8155#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-28 08:39:40,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {8155#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {8150#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {8150#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {8150#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {8150#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {8150#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {8150#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {8150#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {8150#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {8150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8150#false} is VALID [2022-04-28 08:39:40,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {8150#false} ~skip~0 := 0; {8150#false} is VALID [2022-04-28 08:39:40,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2022-04-28 08:39:40,050 INFO L290 TraceCheckUtils]: 43: Hoare triple {8150#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,051 INFO L290 TraceCheckUtils]: 44: Hoare triple {8150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {8150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {8150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {8150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {8150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {8150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {8150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {8150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {8150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {8150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {8150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {8150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {8150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {8150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {8150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {8150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {8150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {8150#false} assume 8544 == #t~mem64;havoc #t~mem64; {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {8150#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {8150#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {8150#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {8150#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {8150#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {8150#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {8150#false} assume 8 == ~blastFlag~0; {8150#false} is VALID [2022-04-28 08:39:40,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {8150#false} assume !false; {8150#false} is VALID [2022-04-28 08:39:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387422628] [2022-04-28 08:39:40,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387422628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:40,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:40,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:40,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1671413127] [2022-04-28 08:39:40,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1671413127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:40,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:40,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446228537] [2022-04-28 08:39:40,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 08:39:40,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:40,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:40,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:40,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:40,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:40,103 INFO L87 Difference]: Start difference. First operand 250 states and 409 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:45,395 INFO L93 Difference]: Finished difference Result 602 states and 977 transitions. [2022-04-28 08:39:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 08:39:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 08:39:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 08:39:45,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 08:39:45,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:45,793 INFO L225 Difference]: With dead ends: 602 [2022-04-28 08:39:45,793 INFO L226 Difference]: Without dead ends: 367 [2022-04-28 08:39:45,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:45,794 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 131 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:45,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 356 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 08:39:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-28 08:39:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 276. [2022-04-28 08:39:45,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:45,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,812 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,812 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:45,818 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-04-28 08:39:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 584 transitions. [2022-04-28 08:39:45,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:45,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:45,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 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 367 states. [2022-04-28 08:39:45,820 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 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 367 states. [2022-04-28 08:39:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:45,826 INFO L93 Difference]: Finished difference Result 367 states and 584 transitions. [2022-04-28 08:39:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 584 transitions. [2022-04-28 08:39:45,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:45,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:45,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:45,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6568265682656826) internal successors, (449), 271 states have internal predecessors, (449), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 453 transitions. [2022-04-28 08:39:45,832 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 453 transitions. Word has length 70 [2022-04-28 08:39:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:45,832 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 453 transitions. [2022-04-28 08:39:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:45,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 453 transitions. [2022-04-28 08:39:46,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 453 transitions. [2022-04-28 08:39:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 08:39:46,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:46,177 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:39:46,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:39:46,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 1 times [2022-04-28 08:39:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:46,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879261653] [2022-04-28 08:39:46,229 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:39:46,230 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:39:46,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -339232893, now seen corresponding path program 2 times [2022-04-28 08:39:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:46,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836436305] [2022-04-28 08:39:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:46,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10651#true} is VALID [2022-04-28 08:39:46,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {10651#true} assume true; {10651#true} is VALID [2022-04-28 08:39:46,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10651#true} {10651#true} #689#return; {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {10651#true} call ULTIMATE.init(); {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:46,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {10658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {10651#true} assume true; {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10651#true} {10651#true} #689#return; {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {10651#true} call #t~ret161 := main(); {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {10651#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {10651#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10651#true} is VALID [2022-04-28 08:39:46,383 INFO L272 TraceCheckUtils]: 7: Hoare triple {10651#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10651#true} is VALID [2022-04-28 08:39:46,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {10651#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:46,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {10656#(not (= 8529 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10657#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-28 08:39:46,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {10657#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {10652#false} is VALID [2022-04-28 08:39:46,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {10652#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {10652#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {10652#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {10652#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {10652#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {10652#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {10652#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {10652#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {10652#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10652#false} is VALID [2022-04-28 08:39:46,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {10652#false} ~skip~0 := 0; {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {10652#false} assume !false; {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {10652#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {10652#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {10652#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {10652#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {10652#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {10652#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {10652#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {10652#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {10652#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {10652#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 54: Hoare triple {10652#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {10652#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {10652#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {10652#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {10652#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {10652#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {10652#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {10652#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {10652#false} assume 8544 == #t~mem64;havoc #t~mem64; {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 63: Hoare triple {10652#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {10652#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {10652#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10652#false} is VALID [2022-04-28 08:39:46,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {10652#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {10652#false} is VALID [2022-04-28 08:39:46,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {10652#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {10652#false} is VALID [2022-04-28 08:39:46,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {10652#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {10652#false} is VALID [2022-04-28 08:39:46,401 INFO L290 TraceCheckUtils]: 69: Hoare triple {10652#false} assume 8 == ~blastFlag~0; {10652#false} is VALID [2022-04-28 08:39:46,401 INFO L290 TraceCheckUtils]: 70: Hoare triple {10652#false} assume !false; {10652#false} is VALID [2022-04-28 08:39:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836436305] [2022-04-28 08:39:46,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836436305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:46,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:46,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:46,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:46,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879261653] [2022-04-28 08:39:46,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879261653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:46,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:46,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134306712] [2022-04-28 08:39:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 71 [2022-04-28 08:39:46,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:46,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:46,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:46,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:46,456 INFO L87 Difference]: Start difference. First operand 276 states and 453 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:48,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:39:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:52,779 INFO L93 Difference]: Finished difference Result 614 states and 994 transitions. [2022-04-28 08:39:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:39:52,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 71 [2022-04-28 08:39:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:39:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 08:39:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 08:39:52,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 08:39:53,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:53,167 INFO L225 Difference]: With dead ends: 614 [2022-04-28 08:39:53,167 INFO L226 Difference]: Without dead ends: 353 [2022-04-28 08:39:53,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:39:53,168 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 130 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:39:53,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 08:39:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-28 08:39:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 276. [2022-04-28 08:39:53,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:39:53,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,179 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,180 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:53,185 INFO L93 Difference]: Finished difference Result 353 states and 557 transitions. [2022-04-28 08:39:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 557 transitions. [2022-04-28 08:39:53,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:53,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:53,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 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 353 states. [2022-04-28 08:39:53,186 INFO L87 Difference]: Start difference. First operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 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 353 states. [2022-04-28 08:39:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:39:53,192 INFO L93 Difference]: Finished difference Result 353 states and 557 transitions. [2022-04-28 08:39:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 557 transitions. [2022-04-28 08:39:53,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:39:53,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:39:53,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:39:53,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:39:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.6457564575645756) internal successors, (446), 271 states have internal predecessors, (446), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 450 transitions. [2022-04-28 08:39:53,198 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 450 transitions. Word has length 71 [2022-04-28 08:39:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:39:53,199 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 450 transitions. [2022-04-28 08:39:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 276 states and 450 transitions. [2022-04-28 08:39:53,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 450 transitions. [2022-04-28 08:39:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 08:39:53,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:39:53,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:39:53,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:39:53,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:39:53,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:39:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 1 times [2022-04-28 08:39:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:53,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160613301] [2022-04-28 08:39:53,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:39:53,541 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:39:53,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:39:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1306774635, now seen corresponding path program 2 times [2022-04-28 08:39:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:39:53,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577976100] [2022-04-28 08:39:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:39:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:39:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:39:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:39:53,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13149#true} is VALID [2022-04-28 08:39:53,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-28 08:39:53,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13149#true} {13149#true} #689#return; {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {13149#true} call ULTIMATE.init(); {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:39:53,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {13156#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13149#true} {13149#true} #689#return; {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {13149#true} call #t~ret161 := main(); {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {13149#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {13149#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13149#true} is VALID [2022-04-28 08:39:53,696 INFO L272 TraceCheckUtils]: 7: Hoare triple {13149#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13149#true} is VALID [2022-04-28 08:39:53,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {13149#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:39:53,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {13154#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13155#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 08:39:53,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {13155#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {13150#false} is VALID [2022-04-28 08:39:53,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {13150#false} assume !(~num1~0 > 0); {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {13150#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {13150#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {13150#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {13150#false} ~skip~0 := 0; {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {13150#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {13150#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {13150#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {13150#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {13150#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {13150#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {13150#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {13150#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {13150#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {13150#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {13150#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {13150#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {13150#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 57: Hoare triple {13150#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {13150#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {13150#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {13150#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 61: Hoare triple {13150#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 62: Hoare triple {13150#false} assume 8544 == #t~mem64;havoc #t~mem64; {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {13150#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,714 INFO L290 TraceCheckUtils]: 64: Hoare triple {13150#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {13150#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {13150#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 67: Hoare triple {13150#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {13150#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {13150#false} assume 8 == ~blastFlag~0; {13150#false} is VALID [2022-04-28 08:39:53,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-28 08:39:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:39:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:39:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577976100] [2022-04-28 08:39:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577976100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:53,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:39:53,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160613301] [2022-04-28 08:39:53,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160613301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:39:53,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:39:53,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:39:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401943417] [2022-04-28 08:39:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:39:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 71 [2022-04-28 08:39:53,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:39:53,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:53,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:39:53,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:39:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:39:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:39:53,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:39:53,762 INFO L87 Difference]: Start difference. First operand 276 states and 450 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:39:57,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:00,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:00,487 INFO L93 Difference]: Finished difference Result 690 states and 1122 transitions. [2022-04-28 08:40:00,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 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 71 [2022-04-28 08:40:00,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 08:40:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 08:40:00,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 08:40:00,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:00,893 INFO L225 Difference]: With dead ends: 690 [2022-04-28 08:40:00,893 INFO L226 Difference]: Without dead ends: 429 [2022-04-28 08:40:00,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:00,895 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 123 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:00,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 414 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 08:40:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-28 08:40:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 340. [2022-04-28 08:40:00,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:00,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,908 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,909 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:00,918 INFO L93 Difference]: Finished difference Result 429 states and 689 transitions. [2022-04-28 08:40:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 689 transitions. [2022-04-28 08:40:00,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:00,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:00,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 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 429 states. [2022-04-28 08:40:00,920 INFO L87 Difference]: Start difference. First operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 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 429 states. [2022-04-28 08:40:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:00,929 INFO L93 Difference]: Finished difference Result 429 states and 689 transitions. [2022-04-28 08:40:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 689 transitions. [2022-04-28 08:40:00,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:00,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:00,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:00,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 335 states have (on average 1.653731343283582) internal successors, (554), 335 states have internal predecessors, (554), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 558 transitions. [2022-04-28 08:40:00,939 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 558 transitions. Word has length 71 [2022-04-28 08:40:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:00,939 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 558 transitions. [2022-04-28 08:40:00,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:00,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 340 states and 558 transitions. [2022-04-28 08:40:01,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 558 transitions. [2022-04-28 08:40:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:40:01,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:01,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:01,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:40:01,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 1 times [2022-04-28 08:40:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:01,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2011270726] [2022-04-28 08:40:01,395 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:01,395 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:01,395 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -351909833, now seen corresponding path program 2 times [2022-04-28 08:40:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:01,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558659455] [2022-04-28 08:40:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:01,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:01,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16079#true} is VALID [2022-04-28 08:40:01,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {16079#true} assume true; {16079#true} is VALID [2022-04-28 08:40:01,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16079#true} {16079#true} #689#return; {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {16079#true} call ULTIMATE.init(); {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:01,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {16086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {16079#true} assume true; {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16079#true} {16079#true} #689#return; {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {16079#true} call #t~ret161 := main(); {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {16079#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {16079#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16079#true} is VALID [2022-04-28 08:40:01,522 INFO L272 TraceCheckUtils]: 7: Hoare triple {16079#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16079#true} is VALID [2022-04-28 08:40:01,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {16079#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:01,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {16084#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16085#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {16085#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {16080#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 44: Hoare triple {16080#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 45: Hoare triple {16080#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 46: Hoare triple {16080#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {16080#false} ~skip~0 := 0; {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {16080#false} assume !false; {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {16080#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 50: Hoare triple {16080#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 51: Hoare triple {16080#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {16080#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {16080#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {16080#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {16080#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {16080#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 57: Hoare triple {16080#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 58: Hoare triple {16080#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {16080#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {16080#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {16080#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {16080#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {16080#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {16080#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {16080#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {16080#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {16080#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 68: Hoare triple {16080#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 69: Hoare triple {16080#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {16080#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {16080#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {16080#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {16080#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {16080#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {16080#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {16080#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {16080#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {16080#false} assume 8640 == #t~mem75;havoc #t~mem75; {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {16080#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {16080#false} assume 4 == ~blastFlag~0; {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {16080#false} assume !false; {16080#false} is VALID [2022-04-28 08:40:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:01,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:01,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558659455] [2022-04-28 08:40:01,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558659455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:01,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:01,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:01,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:01,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2011270726] [2022-04-28 08:40:01,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2011270726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:01,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:01,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647146200] [2022-04-28 08:40:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:40:01,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:01,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:01,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:01,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:01,589 INFO L87 Difference]: Start difference. First operand 340 states and 558 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:06,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:07,939 INFO L93 Difference]: Finished difference Result 782 states and 1272 transitions. [2022-04-28 08:40:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:40:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:40:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:40:07,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 08:40:08,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:08,300 INFO L225 Difference]: With dead ends: 782 [2022-04-28 08:40:08,301 INFO L226 Difference]: Without dead ends: 457 [2022-04-28 08:40:08,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:08,302 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 119 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:08,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 376 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 494 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 08:40:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-28 08:40:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 377. [2022-04-28 08:40:08,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:08,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,316 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,316 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:08,324 INFO L93 Difference]: Finished difference Result 457 states and 731 transitions. [2022-04-28 08:40:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 731 transitions. [2022-04-28 08:40:08,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:08,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:08,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 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 457 states. [2022-04-28 08:40:08,326 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 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 457 states. [2022-04-28 08:40:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:08,333 INFO L93 Difference]: Finished difference Result 457 states and 731 transitions. [2022-04-28 08:40:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 731 transitions. [2022-04-28 08:40:08,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:08,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:08,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:08,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6559139784946237) internal successors, (616), 372 states have internal predecessors, (616), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 620 transitions. [2022-04-28 08:40:08,341 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 620 transitions. Word has length 82 [2022-04-28 08:40:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:08,342 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 620 transitions. [2022-04-28 08:40:08,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:08,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 620 transitions. [2022-04-28 08:40:08,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 620 transitions. [2022-04-28 08:40:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 08:40:08,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:08,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-28 08:40:08,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:40:08,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 1 times [2022-04-28 08:40:08,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223370970] [2022-04-28 08:40:08,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:08,812 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:08,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1069537033, now seen corresponding path program 2 times [2022-04-28 08:40:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191710472] [2022-04-28 08:40:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:08,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19323#true} is VALID [2022-04-28 08:40:08,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {19323#true} assume true; {19323#true} is VALID [2022-04-28 08:40:08,919 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19323#true} {19323#true} #689#return; {19323#true} is VALID [2022-04-28 08:40:08,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {19323#true} call ULTIMATE.init(); {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:08,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {19330#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19323#true} is VALID [2022-04-28 08:40:08,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {19323#true} assume true; {19323#true} is VALID [2022-04-28 08:40:08,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19323#true} {19323#true} #689#return; {19323#true} is VALID [2022-04-28 08:40:08,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {19323#true} call #t~ret161 := main(); {19323#true} is VALID [2022-04-28 08:40:08,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {19323#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19323#true} is VALID [2022-04-28 08:40:08,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {19323#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19323#true} is VALID [2022-04-28 08:40:08,920 INFO L272 TraceCheckUtils]: 7: Hoare triple {19323#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19323#true} is VALID [2022-04-28 08:40:08,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {19323#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:40:08,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {19328#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19329#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 08:40:08,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {19329#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {19324#false} is VALID [2022-04-28 08:40:08,932 INFO L290 TraceCheckUtils]: 44: Hoare triple {19324#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {19324#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {19324#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {19324#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {19324#false} ~skip~0 := 0; {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {19324#false} assume !false; {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {19324#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {19324#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {19324#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {19324#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {19324#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {19324#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {19324#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {19324#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {19324#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 59: Hoare triple {19324#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {19324#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {19324#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {19324#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,933 INFO L290 TraceCheckUtils]: 63: Hoare triple {19324#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {19324#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {19324#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {19324#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {19324#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {19324#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {19324#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {19324#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {19324#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {19324#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {19324#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {19324#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 75: Hoare triple {19324#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {19324#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {19324#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {19324#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 79: Hoare triple {19324#false} assume 8640 == #t~mem75;havoc #t~mem75; {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 80: Hoare triple {19324#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19324#false} is VALID [2022-04-28 08:40:08,934 INFO L290 TraceCheckUtils]: 81: Hoare triple {19324#false} assume 4 == ~blastFlag~0; {19324#false} is VALID [2022-04-28 08:40:08,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {19324#false} assume !false; {19324#false} is VALID [2022-04-28 08:40:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191710472] [2022-04-28 08:40:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191710472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:08,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223370970] [2022-04-28 08:40:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223370970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266526773] [2022-04-28 08:40:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 83 [2022-04-28 08:40:08,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:08,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:09,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:09,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:09,005 INFO L87 Difference]: Start difference. First operand 377 states and 620 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:13,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:14,659 INFO L93 Difference]: Finished difference Result 816 states and 1328 transitions. [2022-04-28 08:40:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 83 [2022-04-28 08:40:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:40:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 08:40:14,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 08:40:15,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:15,020 INFO L225 Difference]: With dead ends: 816 [2022-04-28 08:40:15,020 INFO L226 Difference]: Without dead ends: 454 [2022-04-28 08:40:15,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:15,021 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 118 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:15,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 392 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 08:40:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-04-28 08:40:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 377. [2022-04-28 08:40:15,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:15,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,037 INFO L74 IsIncluded]: Start isIncluded. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,037 INFO L87 Difference]: Start difference. First operand 454 states. Second operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:15,044 INFO L93 Difference]: Finished difference Result 454 states and 725 transitions. [2022-04-28 08:40:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 725 transitions. [2022-04-28 08:40:15,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:15,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:15,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 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 454 states. [2022-04-28 08:40:15,049 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 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 454 states. [2022-04-28 08:40:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:15,056 INFO L93 Difference]: Finished difference Result 454 states and 725 transitions. [2022-04-28 08:40:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 725 transitions. [2022-04-28 08:40:15,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:15,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:15,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:15,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.6505376344086022) internal successors, (614), 372 states have internal predecessors, (614), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 618 transitions. [2022-04-28 08:40:15,067 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 618 transitions. Word has length 83 [2022-04-28 08:40:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:15,067 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 618 transitions. [2022-04-28 08:40:15,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 618 transitions. [2022-04-28 08:40:15,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 618 transitions. [2022-04-28 08:40:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 08:40:15,509 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:15,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:15,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:40:15,510 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 1 times [2022-04-28 08:40:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:15,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191559017] [2022-04-28 08:40:15,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:15,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:15,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -724966751, now seen corresponding path program 2 times [2022-04-28 08:40:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:15,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556035999] [2022-04-28 08:40:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:15,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:15,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22629#true} is VALID [2022-04-28 08:40:15,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {22629#true} assume true; {22629#true} is VALID [2022-04-28 08:40:15,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22629#true} {22629#true} #689#return; {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {22629#true} call ULTIMATE.init(); {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:15,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {22636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {22629#true} assume true; {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22629#true} {22629#true} #689#return; {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {22629#true} call #t~ret161 := main(); {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {22629#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {22629#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22629#true} is VALID [2022-04-28 08:40:15,656 INFO L272 TraceCheckUtils]: 7: Hoare triple {22629#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22629#true} is VALID [2022-04-28 08:40:15,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {22629#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:15,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {22634#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22635#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 08:40:15,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {22635#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {22630#false} is VALID [2022-04-28 08:40:15,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {22630#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {22630#false} is VALID [2022-04-28 08:40:15,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {22630#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {22630#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {22630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {22630#false} ~skip~0 := 0; {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {22630#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {22630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {22630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {22630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {22630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {22630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {22630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {22630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {22630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {22630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {22630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {22630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {22630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {22630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {22630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {22630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {22630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {22630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {22630#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {22630#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {22630#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {22630#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {22630#false} assume 8448 == #t~mem68;havoc #t~mem68; {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {22630#false} assume !(~num1~0 > 0); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {22630#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {22630#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {22630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {22630#false} ~skip~0 := 0; {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {22630#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {22630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {22630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {22630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {22630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 62: Hoare triple {22630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {22630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {22630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {22630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {22630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {22630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {22630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {22630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {22630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {22630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {22630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {22630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {22630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {22630#false} assume 8544 == #t~mem64;havoc #t~mem64; {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {22630#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {22630#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {22630#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L290 TraceCheckUtils]: 79: Hoare triple {22630#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {22630#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {22630#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {22630#false} assume 8 == ~blastFlag~0; {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {22630#false} assume !false; {22630#false} is VALID [2022-04-28 08:40:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 08:40:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:15,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556035999] [2022-04-28 08:40:15,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556035999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:15,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:15,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:15,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191559017] [2022-04-28 08:40:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191559017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478717017] [2022-04-28 08:40:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 84 [2022-04-28 08:40:15,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:15,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:15,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:15,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:15,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:15,705 INFO L87 Difference]: Start difference. First operand 377 states and 618 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:20,469 INFO L93 Difference]: Finished difference Result 856 states and 1390 transitions. [2022-04-28 08:40:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 84 [2022-04-28 08:40:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 08:40:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 08:40:20,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 08:40:20,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:20,829 INFO L225 Difference]: With dead ends: 856 [2022-04-28 08:40:20,829 INFO L226 Difference]: Without dead ends: 494 [2022-04-28 08:40:20,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:20,830 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 139 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:20,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 418 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 08:40:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-04-28 08:40:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 393. [2022-04-28 08:40:20,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:20,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 494 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,846 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,847 INFO L87 Difference]: Start difference. First operand 494 states. Second operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:20,855 INFO L93 Difference]: Finished difference Result 494 states and 784 transitions. [2022-04-28 08:40:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 784 transitions. [2022-04-28 08:40:20,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:20,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:20,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 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 494 states. [2022-04-28 08:40:20,857 INFO L87 Difference]: Start difference. First operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 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 494 states. [2022-04-28 08:40:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:20,865 INFO L93 Difference]: Finished difference Result 494 states and 784 transitions. [2022-04-28 08:40:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 784 transitions. [2022-04-28 08:40:20,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:20,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:20,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:20,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.634020618556701) internal successors, (634), 388 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 638 transitions. [2022-04-28 08:40:20,873 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 638 transitions. Word has length 84 [2022-04-28 08:40:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:20,874 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 638 transitions. [2022-04-28 08:40:20,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:20,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 638 transitions. [2022-04-28 08:40:21,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 638 transitions. [2022-04-28 08:40:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 08:40:21,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:21,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:21,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:40:21,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 1 times [2022-04-28 08:40:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881550010] [2022-04-28 08:40:21,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:21,404 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:21,404 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:21,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1180490630, now seen corresponding path program 2 times [2022-04-28 08:40:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:21,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100045058] [2022-04-28 08:40:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:21,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {26134#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26127#true} is VALID [2022-04-28 08:40:21,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {26127#true} assume true; {26127#true} is VALID [2022-04-28 08:40:21,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26127#true} {26127#true} #689#return; {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {26127#true} call ULTIMATE.init(); {26134#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:21,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {26134#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {26127#true} assume true; {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26127#true} {26127#true} #689#return; {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {26127#true} call #t~ret161 := main(); {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {26127#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {26127#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26127#true} is VALID [2022-04-28 08:40:21,501 INFO L272 TraceCheckUtils]: 7: Hoare triple {26127#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26127#true} is VALID [2022-04-28 08:40:21,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {26127#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:40:21,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26133#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 08:40:21,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {26128#false} is VALID [2022-04-28 08:40:21,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {26128#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {26128#false} is VALID [2022-04-28 08:40:21,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {26128#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {26128#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {26128#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {26128#false} ~skip~0 := 0; {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {26128#false} assume !false; {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {26128#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 30: Hoare triple {26128#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {26128#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {26128#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {26128#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {26128#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {26128#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {26128#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {26128#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {26128#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {26128#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {26128#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 41: Hoare triple {26128#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {26128#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 43: Hoare triple {26128#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 44: Hoare triple {26128#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {26128#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {26128#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {26128#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {26128#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {26128#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {26128#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {26128#false} assume 8448 == #t~mem68;havoc #t~mem68; {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 52: Hoare triple {26128#false} assume !(~num1~0 > 0); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {26128#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {26128#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {26128#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {26128#false} ~skip~0 := 0; {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {26128#false} assume !false; {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {26128#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {26128#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {26128#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {26128#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {26128#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {26128#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 64: Hoare triple {26128#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {26128#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {26128#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {26128#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {26128#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {26128#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {26128#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {26128#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {26128#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {26128#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 74: Hoare triple {26128#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 75: Hoare triple {26128#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {26128#false} assume 8544 == #t~mem64;havoc #t~mem64; {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {26128#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {26128#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {26128#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 80: Hoare triple {26128#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {26128#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {26128#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {26128#false} assume 8 == ~blastFlag~0; {26128#false} is VALID [2022-04-28 08:40:21,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {26128#false} assume !false; {26128#false} is VALID [2022-04-28 08:40:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 08:40:21,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:21,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100045058] [2022-04-28 08:40:21,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100045058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:21,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:21,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:21,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:21,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881550010] [2022-04-28 08:40:21,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881550010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:21,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:21,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235623128] [2022-04-28 08:40:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:40:21,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:21,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:21,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:21,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:21,564 INFO L87 Difference]: Start difference. First operand 393 states and 638 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:23,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:25,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:27,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:28,696 INFO L93 Difference]: Finished difference Result 848 states and 1364 transitions. [2022-04-28 08:40:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:28,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:40:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 08:40:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 08:40:28,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 08:40:29,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:29,081 INFO L225 Difference]: With dead ends: 848 [2022-04-28 08:40:29,081 INFO L226 Difference]: Without dead ends: 470 [2022-04-28 08:40:29,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:29,082 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 138 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:29,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 08:40:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-28 08:40:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 393. [2022-04-28 08:40:29,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:29,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 470 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,099 INFO L74 IsIncluded]: Start isIncluded. First operand 470 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,100 INFO L87 Difference]: Start difference. First operand 470 states. Second operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:29,107 INFO L93 Difference]: Finished difference Result 470 states and 738 transitions. [2022-04-28 08:40:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 738 transitions. [2022-04-28 08:40:29,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:29,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:29,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 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 470 states. [2022-04-28 08:40:29,109 INFO L87 Difference]: Start difference. First operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 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 470 states. [2022-04-28 08:40:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:29,117 INFO L93 Difference]: Finished difference Result 470 states and 738 transitions. [2022-04-28 08:40:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 738 transitions. [2022-04-28 08:40:29,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:29,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:29,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:29,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.615979381443299) internal successors, (627), 388 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 631 transitions. [2022-04-28 08:40:29,125 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 631 transitions. Word has length 85 [2022-04-28 08:40:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:29,125 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 631 transitions. [2022-04-28 08:40:29,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 631 transitions. [2022-04-28 08:40:29,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 631 transitions. [2022-04-28 08:40:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 08:40:29,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:29,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-04-28 08:40:29,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:40:29,616 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash -289742090, now seen corresponding path program 1 times [2022-04-28 08:40:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:29,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237766147] [2022-04-28 08:40:29,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:29,670 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:29,670 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -289742090, now seen corresponding path program 2 times [2022-04-28 08:40:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078753525] [2022-04-28 08:40:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:29,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {29568#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29561#true} is VALID [2022-04-28 08:40:29,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {29561#true} assume true; {29561#true} is VALID [2022-04-28 08:40:29,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29561#true} {29561#true} #689#return; {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {29561#true} call ULTIMATE.init(); {29568#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:29,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {29568#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {29561#true} assume true; {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29561#true} {29561#true} #689#return; {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {29561#true} call #t~ret161 := main(); {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {29561#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29561#true} is VALID [2022-04-28 08:40:29,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {29561#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29561#true} is VALID [2022-04-28 08:40:29,762 INFO L272 TraceCheckUtils]: 7: Hoare triple {29561#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29561#true} is VALID [2022-04-28 08:40:29,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {29561#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:40:29,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {29566#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {29567#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 08:40:29,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {29567#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {29562#false} is VALID [2022-04-28 08:40:29,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {29562#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {29562#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {29562#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {29562#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {29562#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 54: Hoare triple {29562#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {29562#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {29562#false} ~skip~0 := 0; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {29562#false} assume !false; {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {29562#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 59: Hoare triple {29562#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {29562#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {29562#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {29562#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {29562#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 64: Hoare triple {29562#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {29562#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,789 INFO L290 TraceCheckUtils]: 66: Hoare triple {29562#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {29562#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {29562#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {29562#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {29562#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {29562#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {29562#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 73: Hoare triple {29562#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 74: Hoare triple {29562#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {29562#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 76: Hoare triple {29562#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 77: Hoare triple {29562#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 78: Hoare triple {29562#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 79: Hoare triple {29562#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 80: Hoare triple {29562#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 81: Hoare triple {29562#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 82: Hoare triple {29562#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,790 INFO L290 TraceCheckUtils]: 83: Hoare triple {29562#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 84: Hoare triple {29562#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 85: Hoare triple {29562#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 86: Hoare triple {29562#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 87: Hoare triple {29562#false} assume 8640 == #t~mem75;havoc #t~mem75; {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 88: Hoare triple {29562#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 89: Hoare triple {29562#false} assume 4 == ~blastFlag~0; {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L290 TraceCheckUtils]: 90: Hoare triple {29562#false} assume !false; {29562#false} is VALID [2022-04-28 08:40:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:40:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078753525] [2022-04-28 08:40:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078753525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:29,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:29,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:29,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [237766147] [2022-04-28 08:40:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [237766147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:29,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759739354] [2022-04-28 08:40:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 91 [2022-04-28 08:40:29,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:29,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:29,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:29,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:29,850 INFO L87 Difference]: Start difference. First operand 393 states and 631 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:34,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:36,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:37,725 INFO L93 Difference]: Finished difference Result 888 states and 1414 transitions. [2022-04-28 08:40:37,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 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 91 [2022-04-28 08:40:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 08:40:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 08:40:37,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-28 08:40:38,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 588 edges. 588 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:38,095 INFO L225 Difference]: With dead ends: 888 [2022-04-28 08:40:38,096 INFO L226 Difference]: Without dead ends: 510 [2022-04-28 08:40:38,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:38,097 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 110 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:38,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 343 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 08:40:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-28 08:40:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 436. [2022-04-28 08:40:38,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:38,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,125 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,125 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:38,134 INFO L93 Difference]: Finished difference Result 510 states and 801 transitions. [2022-04-28 08:40:38,134 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 801 transitions. [2022-04-28 08:40:38,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:38,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:38,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 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 510 states. [2022-04-28 08:40:38,135 INFO L87 Difference]: Start difference. First operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 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 510 states. [2022-04-28 08:40:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:38,144 INFO L93 Difference]: Finished difference Result 510 states and 801 transitions. [2022-04-28 08:40:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 801 transitions. [2022-04-28 08:40:38,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:38,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:38,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:38,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 431 states have (on average 1.6148491879350348) internal successors, (696), 431 states have internal predecessors, (696), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 700 transitions. [2022-04-28 08:40:38,155 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 700 transitions. Word has length 91 [2022-04-28 08:40:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:38,155 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 700 transitions. [2022-04-28 08:40:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 436 states and 700 transitions. [2022-04-28 08:40:38,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 700 transitions. [2022-04-28 08:40:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 08:40:38,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:38,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 08:40:38,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:40:38,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 1 times [2022-04-28 08:40:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472413421] [2022-04-28 08:40:38,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:38,790 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:38,790 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:38,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2016065217, now seen corresponding path program 2 times [2022-04-28 08:40:38,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:38,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105586746] [2022-04-28 08:40:38,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:38,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:38,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {33248#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33241#true} is VALID [2022-04-28 08:40:38,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {33241#true} assume true; {33241#true} is VALID [2022-04-28 08:40:38,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33241#true} {33241#true} #689#return; {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {33241#true} call ULTIMATE.init(); {33248#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:38,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {33248#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {33241#true} assume true; {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33241#true} {33241#true} #689#return; {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {33241#true} call #t~ret161 := main(); {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {33241#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {33241#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33241#true} is VALID [2022-04-28 08:40:38,897 INFO L272 TraceCheckUtils]: 7: Hoare triple {33241#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33241#true} is VALID [2022-04-28 08:40:38,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {33241#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {33246#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33247#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {33247#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {33242#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {33242#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {33242#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {33242#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {33242#false} assume 8512 == #t~mem60;havoc #t~mem60; {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {33242#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {33242#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {33242#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {33242#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {33242#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {33242#false} ~skip~0 := 0; {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {33242#false} assume !false; {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 37: Hoare triple {33242#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {33242#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {33242#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {33242#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {33242#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {33242#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {33242#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {33242#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {33242#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {33242#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {33242#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {33242#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {33242#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {33242#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {33242#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {33242#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {33242#false} assume 8528 == #t~mem62;havoc #t~mem62; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {33242#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {33242#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {33242#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {33242#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {33242#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 59: Hoare triple {33242#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {33242#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {33242#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 62: Hoare triple {33242#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 63: Hoare triple {33242#false} ~skip~0 := 0; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 64: Hoare triple {33242#false} assume !false; {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {33242#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {33242#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {33242#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {33242#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {33242#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {33242#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {33242#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {33242#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {33242#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {33242#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {33242#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 76: Hoare triple {33242#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 77: Hoare triple {33242#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 78: Hoare triple {33242#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {33242#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {33242#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {33242#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {33242#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {33242#false} assume 8544 == #t~mem64;havoc #t~mem64; {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {33242#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {33242#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {33242#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 87: Hoare triple {33242#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {33242#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 89: Hoare triple {33242#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 90: Hoare triple {33242#false} assume 8 == ~blastFlag~0; {33242#false} is VALID [2022-04-28 08:40:38,907 INFO L290 TraceCheckUtils]: 91: Hoare triple {33242#false} assume !false; {33242#false} is VALID [2022-04-28 08:40:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 08:40:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:38,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105586746] [2022-04-28 08:40:38,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105586746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:38,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:38,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:38,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:38,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472413421] [2022-04-28 08:40:38,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472413421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:38,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:38,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159032817] [2022-04-28 08:40:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 92 [2022-04-28 08:40:38,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:38,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:38,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:38,965 INFO L87 Difference]: Start difference. First operand 436 states and 700 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:45,860 INFO L93 Difference]: Finished difference Result 883 states and 1418 transitions. [2022-04-28 08:40:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:45,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 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 92 [2022-04-28 08:40:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-28 08:40:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2022-04-28 08:40:45,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 448 transitions. [2022-04-28 08:40:46,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:46,130 INFO L225 Difference]: With dead ends: 883 [2022-04-28 08:40:46,131 INFO L226 Difference]: Without dead ends: 462 [2022-04-28 08:40:46,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:46,132 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 20 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:46,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 08:40:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-28 08:40:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 447. [2022-04-28 08:40:46,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:46,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,154 INFO L74 IsIncluded]: Start isIncluded. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,154 INFO L87 Difference]: Start difference. First operand 462 states. Second operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:46,162 INFO L93 Difference]: Finished difference Result 462 states and 736 transitions. [2022-04-28 08:40:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 736 transitions. [2022-04-28 08:40:46,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:46,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:46,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-28 08:40:46,164 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 462 states. [2022-04-28 08:40:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:46,172 INFO L93 Difference]: Finished difference Result 462 states and 736 transitions. [2022-04-28 08:40:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 736 transitions. [2022-04-28 08:40:46,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:46,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:46,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:46,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6131221719457014) internal successors, (713), 442 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 717 transitions. [2022-04-28 08:40:46,182 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 717 transitions. Word has length 92 [2022-04-28 08:40:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:46,182 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 717 transitions. [2022-04-28 08:40:46,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 717 transitions. [2022-04-28 08:40:46,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 717 transitions. [2022-04-28 08:40:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 08:40:46,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:46,779 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:46,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:40:46,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 1 times [2022-04-28 08:40:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:46,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [514300265] [2022-04-28 08:40:46,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:46,835 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:46,836 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 340309531, now seen corresponding path program 2 times [2022-04-28 08:40:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:46,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290630253] [2022-04-28 08:40:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:46,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {36844#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36837#true} is VALID [2022-04-28 08:40:46,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {36837#true} assume true; {36837#true} is VALID [2022-04-28 08:40:46,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36837#true} {36837#true} #689#return; {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {36837#true} call ULTIMATE.init(); {36844#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:46,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {36844#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {36837#true} assume true; {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36837#true} {36837#true} #689#return; {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {36837#true} call #t~ret161 := main(); {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {36837#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {36837#true} is VALID [2022-04-28 08:40:46,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {36837#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36837#true} is VALID [2022-04-28 08:40:46,939 INFO L272 TraceCheckUtils]: 7: Hoare triple {36837#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36837#true} is VALID [2022-04-28 08:40:46,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {36837#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {36842#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36843#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {36843#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {36838#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {36838#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {36838#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {36838#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {36838#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {36838#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {36838#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {36838#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {36838#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {36838#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {36838#false} ~skip~0 := 0; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {36838#false} assume !false; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {36838#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {36838#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {36838#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {36838#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {36838#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {36838#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {36838#false} assume 8480 == #t~mem52;havoc #t~mem52; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {36838#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {36838#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {36838#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 39: Hoare triple {36838#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36838#false} is VALID [2022-04-28 08:40:46,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {36838#false} ~skip~0 := 0; {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {36838#false} assume !false; {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {36838#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {36838#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {36838#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {36838#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {36838#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {36838#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {36838#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {36838#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {36838#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {36838#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {36838#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {36838#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 54: Hoare triple {36838#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {36838#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {36838#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {36838#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {36838#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 59: Hoare triple {36838#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {36838#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {36838#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 62: Hoare triple {36838#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 63: Hoare triple {36838#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 64: Hoare triple {36838#false} assume 8448 == #t~mem68;havoc #t~mem68; {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 65: Hoare triple {36838#false} assume !(~num1~0 > 0); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 66: Hoare triple {36838#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 67: Hoare triple {36838#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {36838#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {36838#false} ~skip~0 := 0; {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 70: Hoare triple {36838#false} assume !false; {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 71: Hoare triple {36838#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {36838#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {36838#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {36838#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {36838#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {36838#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 77: Hoare triple {36838#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {36838#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,946 INFO L290 TraceCheckUtils]: 79: Hoare triple {36838#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 80: Hoare triple {36838#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {36838#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {36838#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {36838#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {36838#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 85: Hoare triple {36838#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {36838#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {36838#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 88: Hoare triple {36838#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 89: Hoare triple {36838#false} assume 8544 == #t~mem64;havoc #t~mem64; {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {36838#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 91: Hoare triple {36838#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {36838#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 93: Hoare triple {36838#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 94: Hoare triple {36838#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 95: Hoare triple {36838#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 96: Hoare triple {36838#false} assume 8 == ~blastFlag~0; {36838#false} is VALID [2022-04-28 08:40:46,947 INFO L290 TraceCheckUtils]: 97: Hoare triple {36838#false} assume !false; {36838#false} is VALID [2022-04-28 08:40:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:40:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:46,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290630253] [2022-04-28 08:40:46,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290630253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:46,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:46,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:46,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:46,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [514300265] [2022-04-28 08:40:46,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [514300265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:46,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:46,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:46,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869612077] [2022-04-28 08:40:46,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:40:46,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:46,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:46,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:46,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:46,995 INFO L87 Difference]: Start difference. First operand 447 states and 717 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:51,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:40:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:53,368 INFO L93 Difference]: Finished difference Result 882 states and 1416 transitions. [2022-04-28 08:40:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:53,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:40:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 08:40:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 446 transitions. [2022-04-28 08:40:53,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 446 transitions. [2022-04-28 08:40:53,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:53,648 INFO L225 Difference]: With dead ends: 882 [2022-04-28 08:40:53,648 INFO L226 Difference]: Without dead ends: 461 [2022-04-28 08:40:53,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:53,649 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 27 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:53,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 08:40:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-28 08:40:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-04-28 08:40:53,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:53,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,670 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,670 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:53,677 INFO L93 Difference]: Finished difference Result 461 states and 734 transitions. [2022-04-28 08:40:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 734 transitions. [2022-04-28 08:40:53,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:53,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:53,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 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 461 states. [2022-04-28 08:40:53,679 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 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 461 states. [2022-04-28 08:40:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:53,687 INFO L93 Difference]: Finished difference Result 461 states and 734 transitions. [2022-04-28 08:40:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 734 transitions. [2022-04-28 08:40:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:53,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:53,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6108597285067874) internal successors, (712), 442 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 716 transitions. [2022-04-28 08:40:53,697 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 716 transitions. Word has length 98 [2022-04-28 08:40:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:53,697 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 716 transitions. [2022-04-28 08:40:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:53,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 716 transitions. [2022-04-28 08:40:54,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 716 edges. 716 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 716 transitions. [2022-04-28 08:40:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 08:40:54,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:40:54,248 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:40:54,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:40:54,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:40:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:40:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 1 times [2022-04-28 08:40:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515386380] [2022-04-28 08:40:54,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:40:54,303 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:40:54,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:40:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1628990895, now seen corresponding path program 2 times [2022-04-28 08:40:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:40:54,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855550091] [2022-04-28 08:40:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:40:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:40:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:40:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:40:54,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {40436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40429#true} is VALID [2022-04-28 08:40:54,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {40429#true} assume true; {40429#true} is VALID [2022-04-28 08:40:54,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40429#true} {40429#true} #689#return; {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {40429#true} call ULTIMATE.init(); {40436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:40:54,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {40436#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#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(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {40429#true} assume true; {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40429#true} {40429#true} #689#return; {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {40429#true} call #t~ret161 := main(); {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {40429#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {40429#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40429#true} is VALID [2022-04-28 08:40:54,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {40429#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40429#true} is VALID [2022-04-28 08:40:54,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {40429#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {40434#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40435#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {40435#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {40430#false} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {40430#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {40430#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {40430#false} is VALID [2022-04-28 08:40:54,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {40430#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {40430#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {40430#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {40430#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {40430#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {40430#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {40430#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {40430#false} ~skip~0 := 0; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {40430#false} assume !false; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {40430#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {40430#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {40430#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {40430#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {40430#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {40430#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {40430#false} assume 8480 == #t~mem52;havoc #t~mem52; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {40430#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {40430#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {40430#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {40430#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {40430#false} ~skip~0 := 0; {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {40430#false} assume !false; {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {40430#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {40430#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {40430#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {40430#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {40430#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {40430#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {40430#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {40430#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {40430#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {40430#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {40430#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {40430#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {40430#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {40430#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {40430#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {40430#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {40430#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {40430#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {40430#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 61: Hoare triple {40430#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 62: Hoare triple {40430#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 63: Hoare triple {40430#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 64: Hoare triple {40430#false} assume 8448 == #t~mem68;havoc #t~mem68; {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 65: Hoare triple {40430#false} assume !(~num1~0 > 0); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {40430#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {40430#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {40430#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {40430#false} ~skip~0 := 0; {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {40430#false} assume !false; {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 71: Hoare triple {40430#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {40430#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {40430#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {40430#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {40430#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 76: Hoare triple {40430#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {40430#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {40430#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 79: Hoare triple {40430#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 80: Hoare triple {40430#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 81: Hoare triple {40430#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 82: Hoare triple {40430#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {40430#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {40430#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {40430#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {40430#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 87: Hoare triple {40430#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {40430#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {40430#false} assume 8544 == #t~mem64;havoc #t~mem64; {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {40430#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {40430#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {40430#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40430#false} is VALID [2022-04-28 08:40:54,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {40430#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {40430#false} is VALID [2022-04-28 08:40:54,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {40430#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40430#false} is VALID [2022-04-28 08:40:54,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {40430#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40430#false} is VALID [2022-04-28 08:40:54,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {40430#false} assume 8 == ~blastFlag~0; {40430#false} is VALID [2022-04-28 08:40:54,417 INFO L290 TraceCheckUtils]: 97: Hoare triple {40430#false} assume !false; {40430#false} is VALID [2022-04-28 08:40:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:40:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:40:54,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855550091] [2022-04-28 08:40:54,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855550091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:54,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:54,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:54,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:40:54,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515386380] [2022-04-28 08:40:54,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515386380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:40:54,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:40:54,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:40:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351661574] [2022-04-28 08:40:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:40:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:40:54,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:40:54,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:54,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:54,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:40:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:40:54,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:40:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:40:54,468 INFO L87 Difference]: Start difference. First operand 447 states and 716 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:59,326 INFO L93 Difference]: Finished difference Result 882 states and 1415 transitions. [2022-04-28 08:40:59,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:40:59,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 08:40:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:40:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 08:40:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 08:40:59,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 08:40:59,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:40:59,602 INFO L225 Difference]: With dead ends: 882 [2022-04-28 08:40:59,602 INFO L226 Difference]: Without dead ends: 461 [2022-04-28 08:40:59,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:40:59,605 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 25 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:40:59,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 08:40:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-28 08:40:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-04-28 08:40:59,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:40:59,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,625 INFO L74 IsIncluded]: Start isIncluded. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,625 INFO L87 Difference]: Start difference. First operand 461 states. Second operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:59,633 INFO L93 Difference]: Finished difference Result 461 states and 733 transitions. [2022-04-28 08:40:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2022-04-28 08:40:59,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:59,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:59,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 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 461 states. [2022-04-28 08:40:59,634 INFO L87 Difference]: Start difference. First operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 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 461 states. [2022-04-28 08:40:59,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:40:59,642 INFO L93 Difference]: Finished difference Result 461 states and 733 transitions. [2022-04-28 08:40:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2022-04-28 08:40:59,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:40:59,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:40:59,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:40:59,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:40:59,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 442 states have (on average 1.6085972850678734) internal successors, (711), 442 states have internal predecessors, (711), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 715 transitions. [2022-04-28 08:40:59,652 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 715 transitions. Word has length 98 [2022-04-28 08:40:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:40:59,652 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 715 transitions. [2022-04-28 08:40:59,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:40:59,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 447 states and 715 transitions. [2022-04-28 08:41:00,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 715 edges. 715 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:41:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 715 transitions. [2022-04-28 08:41:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 08:41:00,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:41:00,211 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:41:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:41:00,212 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:41:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:41:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1597835116, now seen corresponding path program 1 times [2022-04-28 08:41:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:41:00,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855205579] [2022-04-28 08:41:00,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:41:00,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:00,411 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:00,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:41:00,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:41:00,413 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:41:00,417 INFO L158 Benchmark]: Toolchain (without parser) took 108288.36ms. Allocated memory was 203.4MB in the beginning and 305.1MB in the end (delta: 101.7MB). Free memory was 153.1MB in the beginning and 266.1MB in the end (delta: -113.0MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. [2022-04-28 08:41:00,417 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 171.9MB in the beginning and 171.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:41:00,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.48ms. Allocated memory is still 203.4MB. Free memory was 153.0MB in the beginning and 156.5MB in the end (delta: -3.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 08:41:00,418 INFO L158 Benchmark]: Boogie Preprocessor took 94.36ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 146.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:41:00,418 INFO L158 Benchmark]: RCFGBuilder took 1511.09ms. Allocated memory was 203.4MB in the beginning and 253.8MB in the end (delta: 50.3MB). Free memory was 146.4MB in the beginning and 159.0MB in the end (delta: -12.6MB). Peak memory consumption was 38.7MB. Max. memory is 8.0GB. [2022-04-28 08:41:00,418 INFO L158 Benchmark]: TraceAbstraction took 106229.18ms. Allocated memory was 253.8MB in the beginning and 305.1MB in the end (delta: 51.4MB). Free memory was 158.5MB in the beginning and 266.1MB in the end (delta: -107.6MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. [2022-04-28 08:41:00,419 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 171.9MB in the beginning and 171.7MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.48ms. Allocated memory is still 203.4MB. Free memory was 153.0MB in the beginning and 156.5MB in the end (delta: -3.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 94.36ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 146.4MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1511.09ms. Allocated memory was 203.4MB in the beginning and 253.8MB in the end (delta: 50.3MB). Free memory was 146.4MB in the beginning and 159.0MB in the end (delta: -12.6MB). Peak memory consumption was 38.7MB. Max. memory is 8.0GB. * TraceAbstraction took 106229.18ms. Allocated memory was 253.8MB in the beginning and 305.1MB in the end (delta: 51.4MB). Free memory was 158.5MB in the beginning and 266.1MB in the end (delta: -107.6MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:41:00,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...