/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:19:20,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:19:20,458 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:19:20,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:19:20,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:19:20,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:19:20,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:19:20,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:19:20,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:19:20,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:19:20,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:19:20,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:19:20,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:19:20,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:19:20,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:19:20,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:19:20,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:19:20,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:19:20,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:19:20,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:19:20,514 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:19:20,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:19:20,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:19:20,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:19:20,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:19:20,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:19:20,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:19:20,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:19:20,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:19:20,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:19:20,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:19:20,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:19:20,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:19:20,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:19:20,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:19:20,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:19:20,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:19:20,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:19:20,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:19:20,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:19:20,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:19:20,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:19:20,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:19:20,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:19:20,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:19:20,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:19:20,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:19:20,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:19:20,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:19:20,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:19:20,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:19:20,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:19:20,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:19:20,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:19:20,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:19:20,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:19:20,553 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:19:20,553 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:19:20,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:19:20,553 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:19:20,553 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 15:19:20,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:19:20,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:19:20,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:19:20,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:19:20,806 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:19:20,807 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 15:19:20,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61a0e554/dd5a572abc054190bcfe45b42c6e2e03/FLAGb5f56073a [2022-04-28 15:19:21,332 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:19:21,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-2.c [2022-04-28 15:19:21,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61a0e554/dd5a572abc054190bcfe45b42c6e2e03/FLAGb5f56073a [2022-04-28 15:19:21,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c61a0e554/dd5a572abc054190bcfe45b42c6e2e03 [2022-04-28 15:19:21,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:19:21,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:19:21,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:19:21,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:19:21,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:19:21,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:21,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bf2123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21, skipping insertion in model container [2022-04-28 15:19:21,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:21,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:19:21,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:19:21,810 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 15:19:21,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:19:21,834 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:19:21,963 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 15:19:21,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:19:21,985 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:19:21,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21 WrapperNode [2022-04-28 15:19:21,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:19:21,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:19:21,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:19:21,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:19:21,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:21,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:19:22,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:19:22,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:19:22,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:19:22,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (1/1) ... [2022-04-28 15:19:22,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:19:22,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:19:22,151 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 15:19:22,167 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 15:19:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:19:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:19:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:19:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:19:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:19:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:19:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:19:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:19:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:19:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:19:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:19:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:19:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:19:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:19:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:19:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:19:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:19:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:19:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:19:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:19:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:19:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:19:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:19:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:19:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:19:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:19:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:19:22,331 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:19:22,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:19:22,941 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:19:23,499 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:19:23,499 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:19:23,514 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:19:23,526 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:19:23,526 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:19:23,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:19:23 BoogieIcfgContainer [2022-04-28 15:19:23,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:19:23,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:19:23,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:19:23,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:19:23,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:19:21" (1/3) ... [2022-04-28 15:19:23,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e845a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:19:23, skipping insertion in model container [2022-04-28 15:19:23,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:21" (2/3) ... [2022-04-28 15:19:23,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e845a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:19:23, skipping insertion in model container [2022-04-28 15:19:23,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:19:23" (3/3) ... [2022-04-28 15:19:23,539 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2022-04-28 15:19:23,555 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:19:23,555 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:19:23,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:19:23,622 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@79bc248c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41365510 [2022-04-28 15:19:23,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:19:23,631 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 15:19:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 15:19:23,639 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:23,640 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 15:19:23,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-28 15:19:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:23,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398870540] [2022-04-28 15:19:23,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-28 15:19:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:23,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439302292] [2022-04-28 15:19:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:24,231 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(196, 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 15:19:24,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:19:24,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:19:24,234 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 15:19:24,234 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(196, 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 15:19:24,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:19:24,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:19:24,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 15:19:24,236 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(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);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 15:19:24,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-28 15:19:24,236 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 15:19:24,244 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~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 72))))} is VALID [2022-04-28 15:19:24,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} 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 72))))} is VALID [2022-04-28 15:19:24,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:24,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 15:19:24,264 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 15:19:24,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-28 15:19:24,265 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, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-28 15:19:24,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-28 15:19:24,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-28 15:19:24,267 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))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-28 15:19:24,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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 15:19:24,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 15:19:24,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 15:19:24,270 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 15:19:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439302292] [2022-04-28 15:19:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439302292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:24,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:24,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:24,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:24,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398870540] [2022-04-28 15:19:24,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398870540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:24,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:24,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875924637] [2022-04-28 15:19:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:24,285 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 15:19:24,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:24,296 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 15:19:24,350 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 15:19:24,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:24,382 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 15:19:31,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:35,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:37,108 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-28 15:19:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:37,109 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 15:19:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:37,110 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 15:19:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 15:19:37,131 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 15:19:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 15:19:37,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-28 15:19:37,743 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 15:19:37,768 INFO L225 Difference]: With dead ends: 428 [2022-04-28 15:19:37,768 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 15:19:37,772 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 15:19:37,778 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.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, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:37,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:19:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 15:19:37,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-28 15:19:37,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:37,863 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 15:19:37,864 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 15:19:37,864 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 15:19:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:37,884 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 15:19:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 15:19:37,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:37,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:37,893 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 15:19:37,893 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 15:19:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:37,910 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 15:19:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 15:19:37,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:37,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:37,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:37,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:37,912 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 15:19:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 15:19:37,922 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 15:19:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:37,923 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 15:19:37,923 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 15:19:37,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 15:19:38,151 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 15:19:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 15:19:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 15:19:38,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:38,152 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 15:19:38,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:19:38,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:38,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:38,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-28 15:19:38,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:38,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32467841] [2022-04-28 15:19:38,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-28 15:19:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:38,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605666785] [2022-04-28 15:19:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:38,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:38,378 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(196, 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 15:19:38,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 15:19:38,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 15:19:38,379 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 15:19:38,379 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(196, 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 15:19:38,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 15:19:38,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 15:19:38,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {1887#true} call #t~ret161 := main(); {1887#true} is VALID [2022-04-28 15:19:38,380 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(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);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 15:19:38,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1887#true} is VALID [2022-04-28 15:19:38,381 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 15:19:38,383 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~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 72))))} is VALID [2022-04-28 15:19:38,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} 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 72))))} is VALID [2022-04-28 15:19:38,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:19:38,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {1892#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1893#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 15:19:38,408 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 15:19:38,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {1888#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1888#false} is VALID [2022-04-28 15:19:38,408 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, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1888#false} is VALID [2022-04-28 15:19:38,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {1888#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1888#false} is VALID [2022-04-28 15:19:38,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {1888#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1888#false} is VALID [2022-04-28 15:19:38,409 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))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1888#false} is VALID [2022-04-28 15:19:38,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {1888#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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 15:19:38,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {1888#false} assume 8 == ~blastFlag~0; {1888#false} is VALID [2022-04-28 15:19:38,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-04-28 15:19:38,410 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 15:19:38,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605666785] [2022-04-28 15:19:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605666785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:38,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:38,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:38,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32467841] [2022-04-28 15:19:38,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32467841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:38,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:38,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964824129] [2022-04-28 15:19:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:38,412 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 15:19:38,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:38,413 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 15:19:38,458 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 15:19:38,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:38,460 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 15:19:42,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:44,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:46,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:48,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:50,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:50,263 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-28 15:19:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:50,263 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 15:19:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:50,263 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 15:19:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:50,269 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 15:19:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:50,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:19:50,699 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 15:19:50,706 INFO L225 Difference]: With dead ends: 442 [2022-04-28 15:19:50,706 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 15:19:50,707 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 15:19:50,708 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:50,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:19:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 15:19:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-28 15:19:50,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:50,722 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 15:19:50,723 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 15:19:50,723 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 15:19:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:50,732 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 15:19:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 15:19:50,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:50,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:50,733 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 15:19:50,734 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 15:19:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:50,742 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 15:19:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 15:19:50,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:50,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:50,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:50,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:50,744 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 15:19:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 15:19:50,751 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 15:19:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:50,751 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 15:19:50,751 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 15:19:50,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 15:19:50,995 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 15:19:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 15:19:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 15:19:50,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:50,996 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 15:19:50,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:19:50,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-28 15:19:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:50,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17143448] [2022-04-28 15:19:50,997 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-28 15:19:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020408800] [2022-04-28 15:19:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:51,185 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(196, 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 15:19:51,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 15:19:51,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 15:19:51,187 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 15:19:51,188 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(196, 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 15:19:51,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 15:19:51,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 15:19:51,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {3755#true} call #t~ret161 := main(); {3755#true} is VALID [2022-04-28 15:19:51,188 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(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);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 15:19:51,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {3755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3755#true} is VALID [2022-04-28 15:19:51,189 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 15:19:51,191 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} 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 (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:19:51,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {3760#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 15:19:51,233 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 15:19:51,233 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 15:19:51,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#false} assume 4 == ~blastFlag~0; {3756#false} is VALID [2022-04-28 15:19:51,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#false} assume !false; {3756#false} is VALID [2022-04-28 15:19:51,234 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 15:19:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:51,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020408800] [2022-04-28 15:19:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020408800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:51,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:51,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:51,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:51,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17143448] [2022-04-28 15:19:51,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17143448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:51,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:51,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284001178] [2022-04-28 15:19:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:51,236 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 15:19:51,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:51,237 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 15:19:51,286 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 15:19:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:51,288 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 15:19:53,312 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 15:19:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:54,582 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-28 15:19:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:54,582 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 15:19:54,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:54,583 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 15:19:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:54,588 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 15:19:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:54,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:19:55,066 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 15:19:55,073 INFO L225 Difference]: With dead ends: 501 [2022-04-28 15:19:55,074 INFO L226 Difference]: Without dead ends: 317 [2022-04-28 15:19:55,074 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 15:19:55,075 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:55,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:19:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-28 15:19:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-28 15:19:55,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:55,091 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 15:19:55,092 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 15:19:55,093 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 15:19:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:55,102 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 15:19:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 15:19:55,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:55,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:55,103 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 15:19:55,104 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 15:19:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:55,112 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 15:19:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 15:19:55,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:55,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:55,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:55,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:55,114 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 15:19:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 15:19:55,119 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 15:19:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:55,120 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 15:19:55,120 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 15:19:55,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 15:19:55,404 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 15:19:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 15:19:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 15:19:55,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:55,405 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 15:19:55,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:19:55,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-28 15:19:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:55,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1551705995] [2022-04-28 15:19:55,407 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-28 15:19:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:55,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663057475] [2022-04-28 15:19:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:55,549 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(196, 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 15:19:55,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 15:19:55,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 15:19:55,550 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 15:19:55,551 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(196, 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 15:19:55,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 15:19:55,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 15:19:55,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {5881#true} call #t~ret161 := main(); {5881#true} is VALID [2022-04-28 15:19:55,551 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(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);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 15:19:55,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {5881#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5881#true} is VALID [2022-04-28 15:19:55,551 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 15:19:55,553 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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:19:55,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {5886#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5887#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:19:55,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {5887#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {5882#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {5882#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {5882#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {5882#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {5882#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {5882#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {5882#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {5882#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {5882#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {5882#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {5882#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 36: Hoare triple {5882#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {5882#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {5882#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {5882#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {5882#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {5882#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {5882#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {5882#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {5882#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5882#false} is VALID [2022-04-28 15:19:55,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {5882#false} assume 8641 == #t~mem76;havoc #t~mem76; {5882#false} is VALID [2022-04-28 15:19:55,566 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 15:19:55,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {5882#false} assume 4 == ~blastFlag~0; {5882#false} is VALID [2022-04-28 15:19:55,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#false} assume !false; {5882#false} is VALID [2022-04-28 15:19:55,567 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 15:19:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:55,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663057475] [2022-04-28 15:19:55,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663057475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:55,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:55,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:55,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:55,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1551705995] [2022-04-28 15:19:55,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1551705995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:55,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:55,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456637606] [2022-04-28 15:19:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:55,569 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 15:19:55,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:55,570 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 15:19:55,608 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 15:19:55,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:55,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:55,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:55,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:55,610 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 15:20:00,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:02,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:05,346 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-28 15:20:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:05,346 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 15:20:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:05,347 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 15:20:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:20:05,350 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 15:20:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:20:05,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:20:05,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:05,693 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:20:05,693 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:20:05,694 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 15:20:05,695 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:05,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 15:20:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:20:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:20:05,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:05,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:05,713 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:05,714 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:05,720 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:20:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:20:05,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:05,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:05,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 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 267 states. [2022-04-28 15:20:05,722 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 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 267 states. [2022-04-28 15:20:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:05,728 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:20:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:20:05,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:05,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:05,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:05,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:05,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-28 15:20:05,735 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-28 15:20:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:05,735 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-28 15:20:05,736 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 15:20:05,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-28 15:20:06,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-28 15:20:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 15:20:06,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:06,034 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:06,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:20:06,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 1 times [2022-04-28 15:20:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:06,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042880237] [2022-04-28 15:20:06,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:06,059 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 2 times [2022-04-28 15:20:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:06,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644186676] [2022-04-28 15:20:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:06,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {7916#(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(196, 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); {7909#true} is VALID [2022-04-28 15:20:06,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 15:20:06,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-28 15:20:06,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {7909#true} call ULTIMATE.init(); {7916#(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 15:20:06,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {7916#(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(196, 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); {7909#true} is VALID [2022-04-28 15:20:06,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 15:20:06,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-28 15:20:06,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {7909#true} call #t~ret161 := main(); {7909#true} is VALID [2022-04-28 15:20:06,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {7909#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7909#true} is VALID [2022-04-28 15:20:06,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {7909#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7909#true} is VALID [2022-04-28 15:20:06,201 INFO L272 TraceCheckUtils]: 7: Hoare triple {7909#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7909#true} is VALID [2022-04-28 15:20:06,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {7909#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:06,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {7914#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7915#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:20:06,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {7915#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7910#false} is VALID [2022-04-28 15:20:06,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {7910#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {7910#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {7910#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {7910#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {7910#false} ~skip~0 := 0; {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {7910#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {7910#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {7910#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {7910#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {7910#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {7910#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {7910#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {7910#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {7910#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {7910#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {7910#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {7910#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {7910#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {7910#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {7910#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {7910#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {7910#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,218 INFO L290 TraceCheckUtils]: 45: Hoare triple {7910#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {7910#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {7910#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {7910#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {7910#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {7910#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {7910#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {7910#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {7910#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {7910#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#false} assume 8641 == #t~mem76;havoc #t~mem76; {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {7910#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {7910#false} assume 4 == ~blastFlag~0; {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-28 15:20:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644186676] [2022-04-28 15:20:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644186676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:06,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:06,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:06,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:06,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042880237] [2022-04-28 15:20:06,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042880237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:06,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:06,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247810483] [2022-04-28 15:20:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:06,226 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 62 [2022-04-28 15:20:06,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:06,227 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 15:20:06,283 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 15:20:06,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:06,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:06,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:06,284 INFO L87 Difference]: Start difference. First operand 250 states and 407 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 15:20:08,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:10,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:15,083 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 15:20:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:16,157 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-28 15:20:16,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:16,158 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 62 [2022-04-28 15:20:16,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:16,158 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 15:20:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:20:16,161 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 15:20:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:20:16,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:20:16,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:16,501 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:20:16,501 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:20:16,502 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 15:20:16,505 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:16,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:20:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:20:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:20:16,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:16,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:16,532 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:16,532 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:16,538 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:20:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:20:16,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:16,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:16,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 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 267 states. [2022-04-28 15:20:16,540 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 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 267 states. [2022-04-28 15:20:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:16,546 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:20:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:20:16,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:16,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:16,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:16,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-28 15:20:16,553 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-28 15:20:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:16,554 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-28 15:20:16,554 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 15:20:16,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-28 15:20:16,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-28 15:20:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:16,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:16,853 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:16,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:20:16,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 1 times [2022-04-28 15:20:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:16,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517011218] [2022-04-28 15:20:16,880 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:16,880 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 2 times [2022-04-28 15:20:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:16,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417008074] [2022-04-28 15:20:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:16,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:17,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {9944#(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(196, 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); {9937#true} is VALID [2022-04-28 15:20:17,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-28 15:20:17,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {9937#true} call ULTIMATE.init(); {9944#(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 15:20:17,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {9944#(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(196, 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); {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret161 := main(); {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {9937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9937#true} is VALID [2022-04-28 15:20:17,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {9937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9937#true} is VALID [2022-04-28 15:20:17,004 INFO L272 TraceCheckUtils]: 7: Hoare triple {9937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9937#true} is VALID [2022-04-28 15:20:17,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {9937#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:17,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {9942#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9943#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 15:20:17,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {9943#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9938#false} is VALID [2022-04-28 15:20:17,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {9938#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {9938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {9938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9938#false} is VALID [2022-04-28 15:20:17,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {9938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {9938#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, 80 + ~s.offset, 8); {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {9938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {9938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {9938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {9938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {9938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {9938#false} ~skip~0 := 0; {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {9938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {9938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {9938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {9938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {9938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {9938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {9938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {9938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {9938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {9938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {9938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {9938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {9938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {9938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {9938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {9938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {9938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {9938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {9938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {9938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {9938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {9938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {9938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {9938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {9938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {9938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {9938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {9938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {9938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {9938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9938#false} is VALID [2022-04-28 15:20:17,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {9938#false} assume 8641 == #t~mem76;havoc #t~mem76; {9938#false} is VALID [2022-04-28 15:20:17,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {9938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9938#false} is VALID [2022-04-28 15:20:17,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {9938#false} assume 4 == ~blastFlag~0; {9938#false} is VALID [2022-04-28 15:20:17,017 INFO L290 TraceCheckUtils]: 62: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-28 15:20:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:17,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417008074] [2022-04-28 15:20:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417008074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:17,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:17,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:17,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:17,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517011218] [2022-04-28 15:20:17,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517011218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:17,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:17,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877322308] [2022-04-28 15:20:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:17,021 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 63 [2022-04-28 15:20:17,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:17,021 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 15:20:17,072 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 15:20:17,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:17,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:17,074 INFO L87 Difference]: Start difference. First operand 250 states and 406 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 15:20:21,615 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 15:20:23,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:24,981 INFO L93 Difference]: Finished difference Result 561 states and 903 transitions. [2022-04-28 15:20:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:24,981 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 63 [2022-04-28 15:20:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:24,982 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 15:20:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:20:24,986 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 15:20:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:20:24,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 15:20:25,483 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 15:20:25,491 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:25,491 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:25,492 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 15:20:25,493 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:25,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 15:20:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:25,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:25,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:25,505 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:25,505 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:25,514 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-28 15:20:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-28 15:20:25,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:25,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:25,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:20:25,516 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:20:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:25,523 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-28 15:20:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-28 15:20:25,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:25,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:25,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:25,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-28 15:20:25,531 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-28 15:20:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:25,531 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-28 15:20:25,531 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 15:20:25,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-28 15:20:25,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-28 15:20:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:25,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:25,889 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:20:25,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 1 times [2022-04-28 15:20:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:25,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921066679] [2022-04-28 15:20:25,917 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:25,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 2 times [2022-04-28 15:20:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:25,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625797796] [2022-04-28 15:20:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:26,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:26,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {12252#(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(196, 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); {12245#true} is VALID [2022-04-28 15:20:26,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 15:20:26,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12245#true} {12245#true} #689#return; {12245#true} is VALID [2022-04-28 15:20:26,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12252#(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 15:20:26,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {12252#(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(196, 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); {12245#true} is VALID [2022-04-28 15:20:26,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 15:20:26,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12245#true} {12245#true} #689#return; {12245#true} is VALID [2022-04-28 15:20:26,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {12245#true} call #t~ret161 := main(); {12245#true} is VALID [2022-04-28 15:20:26,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {12245#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12245#true} is VALID [2022-04-28 15:20:26,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {12245#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12245#true} is VALID [2022-04-28 15:20:26,066 INFO L272 TraceCheckUtils]: 7: Hoare triple {12245#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12245#true} is VALID [2022-04-28 15:20:26,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:20:26,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {12250#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12251#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:20:26,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {12251#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {12246#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {12246#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {12246#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {12246#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, 80 + ~s.offset, 8); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {12246#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {12246#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {12246#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {12246#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {12246#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {12246#false} ~skip~0 := 0; {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {12246#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {12246#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {12246#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {12246#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {12246#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {12246#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {12246#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {12246#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {12246#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {12246#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {12246#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {12246#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {12246#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {12246#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {12246#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {12246#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {12246#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {12246#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 47: Hoare triple {12246#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,080 INFO L290 TraceCheckUtils]: 48: Hoare triple {12246#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {12246#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {12246#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,081 INFO L290 TraceCheckUtils]: 51: Hoare triple {12246#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,082 INFO L290 TraceCheckUtils]: 52: Hoare triple {12246#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,082 INFO L290 TraceCheckUtils]: 53: Hoare triple {12246#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,082 INFO L290 TraceCheckUtils]: 54: Hoare triple {12246#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 55: Hoare triple {12246#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {12246#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {12246#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {12246#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {12246#false} assume 8641 == #t~mem76;havoc #t~mem76; {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {12246#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 61: Hoare triple {12246#false} assume 4 == ~blastFlag~0; {12246#false} is VALID [2022-04-28 15:20:26,085 INFO L290 TraceCheckUtils]: 62: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 15:20:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:26,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625797796] [2022-04-28 15:20:26,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625797796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:26,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:26,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:26,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:26,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921066679] [2022-04-28 15:20:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921066679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98115269] [2022-04-28 15:20:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:26,088 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 63 [2022-04-28 15:20:26,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:26,089 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 15:20:26,137 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 15:20:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:26,138 INFO L87 Difference]: Start difference. First operand 250 states and 402 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 15:20:28,772 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 15:20:31,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:33,849 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 15:20:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:34,993 INFO L93 Difference]: Finished difference Result 561 states and 896 transitions. [2022-04-28 15:20:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:34,993 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 63 [2022-04-28 15:20:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:34,993 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 15:20:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:20:34,997 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 15:20:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:20:35,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:20:35,481 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 15:20:35,489 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:35,489 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:35,490 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 15:20:35,490 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:35,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:20:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:35,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:35,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:35,502 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:35,503 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:35,510 INFO L93 Difference]: Finished difference Result 337 states and 526 transitions. [2022-04-28 15:20:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 526 transitions. [2022-04-28 15:20:35,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:35,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:35,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:20:35,512 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:20:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:35,520 INFO L93 Difference]: Finished difference Result 337 states and 526 transitions. [2022-04-28 15:20:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 526 transitions. [2022-04-28 15:20:35,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:35,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:35,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:35,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-28 15:20:35,526 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 63 [2022-04-28 15:20:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:35,527 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-28 15:20:35,527 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 15:20:35,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-28 15:20:35,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-28 15:20:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:35,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:35,884 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-04-28 15:20:35,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:20:35,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:35,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 1 times [2022-04-28 15:20:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:35,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [605347953] [2022-04-28 15:20:35,904 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:35,904 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 2 times [2022-04-28 15:20:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:35,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688525510] [2022-04-28 15:20:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:36,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {14560#(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(196, 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); {14553#true} is VALID [2022-04-28 15:20:36,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {14553#true} assume true; {14553#true} is VALID [2022-04-28 15:20:36,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14553#true} {14553#true} #689#return; {14553#true} is VALID [2022-04-28 15:20:36,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {14553#true} call ULTIMATE.init(); {14560#(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 15:20:36,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {14560#(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(196, 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); {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {14553#true} assume true; {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14553#true} {14553#true} #689#return; {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {14553#true} call #t~ret161 := main(); {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {14553#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {14553#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14553#true} is VALID [2022-04-28 15:20:36,052 INFO L272 TraceCheckUtils]: 7: Hoare triple {14553#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14553#true} is VALID [2022-04-28 15:20:36,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {14553#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:36,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {14558#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14559#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-28 15:20:36,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {14559#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {14554#false} is VALID [2022-04-28 15:20:36,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {14554#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14554#false} is VALID [2022-04-28 15:20:36,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {14554#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {14554#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {14554#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {14554#false} ~skip~0 := 0; {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {14554#false} assume !false; {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {14554#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {14554#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {14554#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {14554#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {14554#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {14554#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {14554#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {14554#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {14554#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {14554#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {14554#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {14554#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {14554#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {14554#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {14554#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {14554#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {14554#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {14554#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 47: Hoare triple {14554#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {14554#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {14554#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {14554#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {14554#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {14554#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {14554#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 54: Hoare triple {14554#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 55: Hoare triple {14554#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {14554#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {14554#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {14554#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14554#false} is VALID [2022-04-28 15:20:36,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {14554#false} assume 8641 == #t~mem76;havoc #t~mem76; {14554#false} is VALID [2022-04-28 15:20:36,067 INFO L290 TraceCheckUtils]: 60: Hoare triple {14554#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14554#false} is VALID [2022-04-28 15:20:36,067 INFO L290 TraceCheckUtils]: 61: Hoare triple {14554#false} assume 4 == ~blastFlag~0; {14554#false} is VALID [2022-04-28 15:20:36,067 INFO L290 TraceCheckUtils]: 62: Hoare triple {14554#false} assume !false; {14554#false} is VALID [2022-04-28 15:20:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:36,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688525510] [2022-04-28 15:20:36,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688525510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:36,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:36,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:36,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:36,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [605347953] [2022-04-28 15:20:36,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [605347953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:36,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:36,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067485363] [2022-04-28 15:20:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:36,070 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 63 [2022-04-28 15:20:36,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:36,070 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 15:20:36,127 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 15:20:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:36,128 INFO L87 Difference]: Start difference. First operand 250 states and 398 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 15:20:38,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:42,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:44,856 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 15:20:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:45,763 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-28 15:20:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:45,763 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 63 [2022-04-28 15:20:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:45,763 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 15:20:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:20:45,767 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 15:20:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:20:45,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:20:46,123 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 15:20:46,129 INFO L225 Difference]: With dead ends: 488 [2022-04-28 15:20:46,129 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:20:46,130 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 15:20:46,130 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:46,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 357 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 15:20:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:20:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-28 15:20:46,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:46,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,149 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,150 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:46,156 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:20:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:20:46,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:46,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:46,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 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 264 states. [2022-04-28 15:20:46,158 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 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 264 states. [2022-04-28 15:20:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:46,163 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:20:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:20:46,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:46,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:46,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:46,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-28 15:20:46,171 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 63 [2022-04-28 15:20:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:46,172 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-28 15:20:46,172 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 15:20:46,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-28 15:20:46,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-28 15:20:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:46,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:46,530 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-04-28 15:20:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:20:46,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 1 times [2022-04-28 15:20:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:46,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187952339] [2022-04-28 15:20:46,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:46,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 2 times [2022-04-28 15:20:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:46,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121744180] [2022-04-28 15:20:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:46,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {16576#(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(196, 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); {16569#true} is VALID [2022-04-28 15:20:46,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {16569#true} assume true; {16569#true} is VALID [2022-04-28 15:20:46,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16569#true} {16569#true} #689#return; {16569#true} is VALID [2022-04-28 15:20:46,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {16569#true} call ULTIMATE.init(); {16576#(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 15:20:46,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {16576#(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(196, 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); {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {16569#true} assume true; {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16569#true} {16569#true} #689#return; {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {16569#true} call #t~ret161 := main(); {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {16569#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {16569#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16569#true} is VALID [2022-04-28 15:20:46,725 INFO L272 TraceCheckUtils]: 7: Hoare triple {16569#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16569#true} is VALID [2022-04-28 15:20:46,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {16569#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:20:46,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {16574#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16575#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {16575#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {16570#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {16570#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {16570#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 27: Hoare triple {16570#false} ~skip~0 := 0; {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {16570#false} assume !false; {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {16570#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {16570#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {16570#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {16570#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {16570#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {16570#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 35: Hoare triple {16570#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {16570#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {16570#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {16570#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {16570#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {16570#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,736 INFO L290 TraceCheckUtils]: 41: Hoare triple {16570#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {16570#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {16570#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 44: Hoare triple {16570#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 45: Hoare triple {16570#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 46: Hoare triple {16570#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 47: Hoare triple {16570#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {16570#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {16570#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {16570#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {16570#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 52: Hoare triple {16570#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 53: Hoare triple {16570#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 54: Hoare triple {16570#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 55: Hoare triple {16570#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {16570#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {16570#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {16570#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {16570#false} assume 8641 == #t~mem76;havoc #t~mem76; {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {16570#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16570#false} is VALID [2022-04-28 15:20:46,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {16570#false} assume 4 == ~blastFlag~0; {16570#false} is VALID [2022-04-28 15:20:46,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {16570#false} assume !false; {16570#false} is VALID [2022-04-28 15:20:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:46,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121744180] [2022-04-28 15:20:46,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121744180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:46,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:46,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:46,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:46,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187952339] [2022-04-28 15:20:46,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187952339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:46,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:46,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525217522] [2022-04-28 15:20:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:46,741 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 63 [2022-04-28 15:20:46,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:46,741 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 15:20:46,789 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 15:20:46,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:46,791 INFO L87 Difference]: Start difference. First operand 250 states and 397 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 15:20:48,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:50,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:56,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,181 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-28 15:20:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:57,181 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 63 [2022-04-28 15:20:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:57,182 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 15:20:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:20:57,185 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 15:20:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:20:57,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-28 15:20:57,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:57,534 INFO L225 Difference]: With dead ends: 487 [2022-04-28 15:20:57,534 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 15:20:57,534 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 15:20:57,535 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:57,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:20:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 15:20:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-28 15:20:57,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:57,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:57,557 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:57,558 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,562 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:20:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:20:57,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:57,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:57,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 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 263 states. [2022-04-28 15:20:57,564 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 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 263 states. [2022-04-28 15:20:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,568 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:20:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:20:57,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:57,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:57,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:57,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:57,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:20:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-28 15:20:57,574 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 63 [2022-04-28 15:20:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:57,575 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-28 15:20:57,575 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 15:20:57,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-28 15:20:57,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-28 15:20:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:20:57,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:57,868 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:20:57,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:20:57,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 1 times [2022-04-28 15:20:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:57,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197447032] [2022-04-28 15:20:57,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:57,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 2 times [2022-04-28 15:20:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815815984] [2022-04-28 15:20:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:57,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:57,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {18588#(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(196, 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); {18581#true} is VALID [2022-04-28 15:20:57,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-28 15:20:57,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18581#true} {18581#true} #689#return; {18581#true} is VALID [2022-04-28 15:20:57,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18588#(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 15:20:57,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {18588#(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(196, 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); {18581#true} is VALID [2022-04-28 15:20:57,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-28 15:20:57,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18581#true} {18581#true} #689#return; {18581#true} is VALID [2022-04-28 15:20:57,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {18581#true} call #t~ret161 := main(); {18581#true} is VALID [2022-04-28 15:20:57,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {18581#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18581#true} is VALID [2022-04-28 15:20:57,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {18581#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18581#true} is VALID [2022-04-28 15:20:57,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {18581#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18581#true} is VALID [2022-04-28 15:20:58,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {18581#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:20:58,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {18586#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18587#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-28 15:20:58,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {18587#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {18582#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {18582#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {18582#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {18582#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, 80 + ~s.offset, 8); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {18582#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {18582#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {18582#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {18582#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {18582#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18582#false} is VALID [2022-04-28 15:20:58,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {18582#false} ~skip~0 := 0; {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {18582#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {18582#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {18582#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {18582#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {18582#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {18582#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {18582#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {18582#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {18582#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {18582#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {18582#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {18582#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {18582#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {18582#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {18582#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 45: Hoare triple {18582#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 46: Hoare triple {18582#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,007 INFO L290 TraceCheckUtils]: 47: Hoare triple {18582#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {18582#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {18582#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {18582#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {18582#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {18582#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {18582#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {18582#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 55: Hoare triple {18582#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {18582#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {18582#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 58: Hoare triple {18582#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {18582#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {18582#false} assume 8641 == #t~mem76;havoc #t~mem76; {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {18582#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {18582#false} assume 4 == ~blastFlag~0; {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-28 15:20:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:20:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815815984] [2022-04-28 15:20:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815815984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:58,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:58,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:58,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:58,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197447032] [2022-04-28 15:20:58,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197447032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:58,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:58,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301121369] [2022-04-28 15:20:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-28 15:20:58,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:58,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 15:20:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:20:58,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:58,061 INFO L87 Difference]: Start difference. First operand 250 states and 396 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 15:21:00,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:04,546 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 15:21:06,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:07,876 INFO L93 Difference]: Finished difference Result 561 states and 887 transitions. [2022-04-28 15:21:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 64 [2022-04-28 15:21:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 15:21:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:21:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 15:21:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:21:07,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 15:21:08,280 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 15:21:08,288 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:21:08,288 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:21:08,289 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 15:21:08,289 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 143 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:08,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:21:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:21:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:21:08,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:08,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:08,301 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:08,301 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:08,308 INFO L93 Difference]: Finished difference Result 337 states and 520 transitions. [2022-04-28 15:21:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 520 transitions. [2022-04-28 15:21:08,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:08,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:08,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:21:08,309 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:21:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:08,316 INFO L93 Difference]: Finished difference Result 337 states and 520 transitions. [2022-04-28 15:21:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 520 transitions. [2022-04-28 15:21:08,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:08,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:08,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:08,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-28 15:21:08,322 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 64 [2022-04-28 15:21:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:08,323 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-28 15:21:08,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 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 15:21:08,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-28 15:21:08,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-28 15:21:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:21:08,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:08,608 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:08,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:21:08,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 1 times [2022-04-28 15:21:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:08,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [647327901] [2022-04-28 15:21:08,645 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:21:08,645 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:08,645 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 2 times [2022-04-28 15:21:08,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:08,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178515592] [2022-04-28 15:21:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:08,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {20896#(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(196, 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); {20889#true} is VALID [2022-04-28 15:21:08,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {20889#true} assume true; {20889#true} is VALID [2022-04-28 15:21:08,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20889#true} {20889#true} #689#return; {20889#true} is VALID [2022-04-28 15:21:08,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {20889#true} call ULTIMATE.init(); {20896#(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 15:21:08,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {20896#(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(196, 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); {20889#true} is VALID [2022-04-28 15:21:08,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {20889#true} assume true; {20889#true} is VALID [2022-04-28 15:21:08,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20889#true} {20889#true} #689#return; {20889#true} is VALID [2022-04-28 15:21:08,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {20889#true} call #t~ret161 := main(); {20889#true} is VALID [2022-04-28 15:21:08,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {20889#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20889#true} is VALID [2022-04-28 15:21:08,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {20889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {20889#true} is VALID [2022-04-28 15:21:08,789 INFO L272 TraceCheckUtils]: 7: Hoare triple {20889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20889#true} is VALID [2022-04-28 15:21:08,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {20889#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:08,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {20894#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20895#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:21:08,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {20895#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20890#false} is VALID [2022-04-28 15:21:08,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {20890#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {20890#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20890#false} is VALID [2022-04-28 15:21:08,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {20890#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {20890#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, 80 + ~s.offset, 8); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {20890#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {20890#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {20890#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {20890#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {20890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {20890#false} ~skip~0 := 0; {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {20890#false} assume !false; {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {20890#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {20890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {20890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {20890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {20890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {20890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {20890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {20890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {20890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {20890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {20890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {20890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {20890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {20890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {20890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {20890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 47: Hoare triple {20890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {20890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {20890#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {20890#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {20890#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {20890#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 53: Hoare triple {20890#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,799 INFO L290 TraceCheckUtils]: 54: Hoare triple {20890#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 55: Hoare triple {20890#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 56: Hoare triple {20890#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 57: Hoare triple {20890#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 58: Hoare triple {20890#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 59: Hoare triple {20890#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 60: Hoare triple {20890#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 61: Hoare triple {20890#false} assume 8641 == #t~mem76;havoc #t~mem76; {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {20890#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {20890#false} assume 4 == ~blastFlag~0; {20890#false} is VALID [2022-04-28 15:21:08,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {20890#false} assume !false; {20890#false} is VALID [2022-04-28 15:21:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:21:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178515592] [2022-04-28 15:21:08,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178515592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:08,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:08,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:08,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:08,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [647327901] [2022-04-28 15:21:08,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [647327901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:08,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:08,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:08,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373177304] [2022-04-28 15:21:08,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:08,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 65 [2022-04-28 15:21:08,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:08,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 15:21:08,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:08,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:08,865 INFO L87 Difference]: Start difference. First operand 250 states and 392 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 15:21:11,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:13,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:18,638 INFO L93 Difference]: Finished difference Result 561 states and 880 transitions. [2022-04-28 15:21:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 65 [2022-04-28 15:21:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 15:21:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:21:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 15:21:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:21:18,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-28 15:21:19,034 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 15:21:19,040 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:21:19,040 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:21:19,040 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 15:21:19,041 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:19,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 15:21:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:21:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:21:19,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:19,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 15:21:19,053 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 15:21:19,053 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 15:21:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:19,061 INFO L93 Difference]: Finished difference Result 337 states and 516 transitions. [2022-04-28 15:21:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 516 transitions. [2022-04-28 15:21:19,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:19,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:19,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 337 states. [2022-04-28 15:21:19,063 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 337 states. [2022-04-28 15:21:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:19,069 INFO L93 Difference]: Finished difference Result 337 states and 516 transitions. [2022-04-28 15:21:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 516 transitions. [2022-04-28 15:21:19,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:19,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:19,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:19,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 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 15:21:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-28 15:21:19,082 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 65 [2022-04-28 15:21:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:19,082 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-28 15:21:19,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 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 15:21:19,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-28 15:21:19,380 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 15:21:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-28 15:21:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:21:19,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:19,381 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:21:19,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:21:19,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 1 times [2022-04-28 15:21:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690548156] [2022-04-28 15:21:19,413 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:21:19,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:19,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 2 times [2022-04-28 15:21:19,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:19,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094943100] [2022-04-28 15:21:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:19,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {23204#(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(196, 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); {23197#true} is VALID [2022-04-28 15:21:19,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {23197#true} assume true; {23197#true} is VALID [2022-04-28 15:21:19,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23197#true} {23197#true} #689#return; {23197#true} is VALID [2022-04-28 15:21:19,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {23197#true} call ULTIMATE.init(); {23204#(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 15:21:19,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {23204#(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(196, 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); {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {23197#true} assume true; {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23197#true} {23197#true} #689#return; {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {23197#true} call #t~ret161 := main(); {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {23197#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {23197#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23197#true} is VALID [2022-04-28 15:21:19,526 INFO L272 TraceCheckUtils]: 7: Hoare triple {23197#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23197#true} is VALID [2022-04-28 15:21:19,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {23197#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:21:19,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {23202#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23203#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {23203#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {23198#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {23198#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {23198#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {23198#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, 80 + ~s.offset, 8); {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {23198#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {23198#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {23198#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {23198#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {23198#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {23198#false} ~skip~0 := 0; {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {23198#false} assume !false; {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {23198#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {23198#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {23198#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {23198#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {23198#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {23198#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {23198#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {23198#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {23198#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {23198#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {23198#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 43: Hoare triple {23198#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {23198#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {23198#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 46: Hoare triple {23198#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 47: Hoare triple {23198#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 48: Hoare triple {23198#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {23198#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {23198#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {23198#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {23198#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {23198#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {23198#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 55: Hoare triple {23198#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 56: Hoare triple {23198#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {23198#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {23198#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {23198#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {23198#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {23198#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {23198#false} assume 8641 == #t~mem76;havoc #t~mem76; {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L290 TraceCheckUtils]: 63: Hoare triple {23198#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L290 TraceCheckUtils]: 64: Hoare triple {23198#false} assume 4 == ~blastFlag~0; {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L290 TraceCheckUtils]: 65: Hoare triple {23198#false} assume !false; {23198#false} is VALID [2022-04-28 15:21:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:21:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094943100] [2022-04-28 15:21:19,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094943100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:19,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:19,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:19,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:19,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690548156] [2022-04-28 15:21:19,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690548156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:19,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:19,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:19,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274770358] [2022-04-28 15:21:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:19,540 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 66 [2022-04-28 15:21:19,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:19,540 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 15:21:19,592 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 15:21:19,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:19,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:19,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:19,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:19,594 INFO L87 Difference]: Start difference. First operand 250 states and 388 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 15:21:22,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:26,332 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 15:21:28,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:29,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:29,209 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-28 15:21:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:29,210 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 66 [2022-04-28 15:21:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:29,210 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 15:21:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:21:29,212 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 15:21:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:21:29,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:21:29,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:29,509 INFO L225 Difference]: With dead ends: 477 [2022-04-28 15:21:29,509 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:21:29,509 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 15:21:29,510 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:29,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 2 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 15:21:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:21:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-28 15:21:29,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:29,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:29,524 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:29,525 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:29,529 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:21:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:21:29,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:29,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:29,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 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 253 states. [2022-04-28 15:21:29,532 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 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 253 states. [2022-04-28 15:21:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:29,536 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:21:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:21:29,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:29,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:29,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:29,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-28 15:21:29,542 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 66 [2022-04-28 15:21:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:29,542 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-28 15:21:29,542 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 15:21:29,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-28 15:21:29,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-28 15:21:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:21:29,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:29,904 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-28 15:21:29,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:21:29,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:29,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 1 times [2022-04-28 15:21:29,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:29,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208588274] [2022-04-28 15:21:29,925 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:29,925 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 2 times [2022-04-28 15:21:29,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:29,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332573526] [2022-04-28 15:21:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:30,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:30,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {25176#(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(196, 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); {25169#true} is VALID [2022-04-28 15:21:30,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 15:21:30,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25169#true} {25169#true} #689#return; {25169#true} is VALID [2022-04-28 15:21:30,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {25169#true} call ULTIMATE.init(); {25176#(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 15:21:30,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {25176#(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(196, 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); {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#true} {25169#true} #689#return; {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#true} call #t~ret161 := main(); {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {25169#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {25169#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {25169#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {25169#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {25169#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25169#true} is VALID [2022-04-28 15:21:30,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {25169#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {25169#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {25169#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {25169#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {25169#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {25169#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {25169#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {25169#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {25169#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {25169#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {25169#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {25169#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {25169#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {25169#true} assume 8464 == #t~mem55;havoc #t~mem55; {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {25169#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25169#true} is VALID [2022-04-28 15:21:30,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {25169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25169#true} is VALID [2022-04-28 15:21:30,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {25169#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:21:30,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {25174#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25175#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 15:21:30,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {25175#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {25170#false} is VALID [2022-04-28 15:21:30,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {25170#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25170#false} is VALID [2022-04-28 15:21:30,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {25170#false} assume 4 == ~blastFlag~0; {25170#false} is VALID [2022-04-28 15:21:30,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {25170#false} assume !false; {25170#false} is VALID [2022-04-28 15:21:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:21:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:30,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332573526] [2022-04-28 15:21:30,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332573526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:30,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:30,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:30,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:30,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208588274] [2022-04-28 15:21:30,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208588274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:30,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:30,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98528855] [2022-04-28 15:21:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:30,095 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 66 [2022-04-28 15:21:30,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:30,096 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 15:21:30,158 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 15:21:30,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:30,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:30,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:30,159 INFO L87 Difference]: Start difference. First operand 250 states and 387 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 15:21:33,351 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 15:21:35,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:38,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:40,046 INFO L93 Difference]: Finished difference Result 561 states and 872 transitions. [2022-04-28 15:21:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:40,046 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 66 [2022-04-28 15:21:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:40,046 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 15:21:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:21:40,048 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 15:21:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:21:40,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:21:40,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 587 edges. 587 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:40,445 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:21:40,445 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:21:40,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:21:40,446 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 115 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:40,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 15:21:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:21:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 261. [2022-04-28 15:21:40,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:40,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,459 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,459 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:40,465 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2022-04-28 15:21:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 514 transitions. [2022-04-28 15:21:40,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:40,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:40,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:21:40,467 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:21:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:40,473 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2022-04-28 15:21:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 514 transitions. [2022-04-28 15:21:40,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:40,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:40,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:40,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-28 15:21:40,478 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 66 [2022-04-28 15:21:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:40,478 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-28 15:21:40,478 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 15:21:40,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-28 15:21:40,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-28 15:21:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:21:40,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:40,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 15:21:40,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:21:40,779 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:40,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 1 times [2022-04-28 15:21:40,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:40,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656241629] [2022-04-28 15:21:40,851 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:40,851 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 2 times [2022-04-28 15:21:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:40,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786914676] [2022-04-28 15:21:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:41,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {27506#(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(196, 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); {27499#true} is VALID [2022-04-28 15:21:41,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-28 15:21:41,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27499#true} {27499#true} #689#return; {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27506#(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 15:21:41,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {27506#(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(196, 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); {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #689#return; {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret161 := main(); {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {27499#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27499#true} is VALID [2022-04-28 15:21:41,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {27499#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L272 TraceCheckUtils]: 7: Hoare triple {27499#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {27499#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {27499#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {27499#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {27499#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {27499#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {27499#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {27499#true} assume !false; {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {27499#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {27499#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {27499#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {27499#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {27499#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {27499#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {27499#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {27499#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27499#true} is VALID [2022-04-28 15:21:41,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {27499#true} assume 8464 == #t~mem55;havoc #t~mem55; {27499#true} is VALID [2022-04-28 15:21:41,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27499#true} is VALID [2022-04-28 15:21:41,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27499#true} is VALID [2022-04-28 15:21:41,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {27499#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:21:41,023 INFO L290 TraceCheckUtils]: 47: Hoare triple {27504#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27505#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-28 15:21:41,023 INFO L290 TraceCheckUtils]: 48: Hoare triple {27505#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {27500#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {27500#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {27500#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {27500#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {27500#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {27500#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {27500#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,024 INFO L290 TraceCheckUtils]: 56: Hoare triple {27500#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {27500#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {27500#false} ~skip~0 := 0; {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 60: Hoare triple {27500#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {27500#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {27500#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 63: Hoare triple {27500#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 64: Hoare triple {27500#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {27500#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {27500#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {27500#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 68: Hoare triple {27500#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 69: Hoare triple {27500#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 70: Hoare triple {27500#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 71: Hoare triple {27500#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {27500#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 73: Hoare triple {27500#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 74: Hoare triple {27500#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {27500#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {27500#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 77: Hoare triple {27500#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {27500#false} assume 8544 == #t~mem64;havoc #t~mem64; {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 79: Hoare triple {27500#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 80: Hoare triple {27500#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 81: Hoare triple {27500#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 82: Hoare triple {27500#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 83: Hoare triple {27500#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 84: Hoare triple {27500#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 85: Hoare triple {27500#false} assume 8 == ~blastFlag~0; {27500#false} is VALID [2022-04-28 15:21:41,027 INFO L290 TraceCheckUtils]: 86: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-28 15:21:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:21:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:41,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786914676] [2022-04-28 15:21:41,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786914676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:41,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:41,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:41,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656241629] [2022-04-28 15:21:41,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656241629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:41,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:41,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637888281] [2022-04-28 15:21:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 87 [2022-04-28 15:21:41,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:41,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:21:41,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:41,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:41,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:41,100 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:21:44,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:46,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:48,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:51,214 INFO L93 Difference]: Finished difference Result 612 states and 959 transitions. [2022-04-28 15:21:51,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 87 [2022-04-28 15:21:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:21:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:51,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:21:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:51,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:21:51,612 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 15:21:51,618 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:21:51,618 INFO L226 Difference]: Without dead ends: 377 [2022-04-28 15:21:51,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:21:51,619 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:51,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 358 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 15:21:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-28 15:21:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 287. [2022-04-28 15:21:51,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:51,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:51,637 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:51,638 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:51,645 INFO L93 Difference]: Finished difference Result 377 states and 578 transitions. [2022-04-28 15:21:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 578 transitions. [2022-04-28 15:21:51,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:51,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:51,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 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 377 states. [2022-04-28 15:21:51,647 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 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 377 states. [2022-04-28 15:21:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:51,655 INFO L93 Difference]: Finished difference Result 377 states and 578 transitions. [2022-04-28 15:21:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 578 transitions. [2022-04-28 15:21:51,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:51,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:51,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:51,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:21:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-28 15:21:51,662 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-28 15:21:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:51,663 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-28 15:21:51,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:21:51,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-28 15:21:52,006 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 15:21:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-28 15:21:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:21:52,007 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:52,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:21:52,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:21:52,008 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:52,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 1 times [2022-04-28 15:21:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:52,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896594665] [2022-04-28 15:21:52,068 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:52,068 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 2 times [2022-04-28 15:21:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54124167] [2022-04-28 15:21:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:52,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:52,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {30070#(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(196, 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); {30063#true} is VALID [2022-04-28 15:21:52,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:21:52,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30063#true} {30063#true} #689#return; {30063#true} is VALID [2022-04-28 15:21:52,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {30063#true} call ULTIMATE.init(); {30070#(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 15:21:52,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {30070#(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(196, 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); {30063#true} is VALID [2022-04-28 15:21:52,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:21:52,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30063#true} {30063#true} #689#return; {30063#true} is VALID [2022-04-28 15:21:52,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {30063#true} call #t~ret161 := main(); {30063#true} is VALID [2022-04-28 15:21:52,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {30063#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {30063#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L272 TraceCheckUtils]: 7: Hoare triple {30063#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {30063#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {30063#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {30063#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {30063#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {30063#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {30063#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-28 15:21:52,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {30063#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {30063#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {30063#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {30063#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {30063#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {30063#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {30063#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {30063#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {30063#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {30063#true} assume 8464 == #t~mem55;havoc #t~mem55; {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {30063#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30063#true} is VALID [2022-04-28 15:21:52,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {30063#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30063#true} is VALID [2022-04-28 15:21:52,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {30063#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} ~skip~0 := 0; {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !false; {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:21:52,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {30068#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30069#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-28 15:21:52,234 INFO L290 TraceCheckUtils]: 49: Hoare triple {30069#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {30064#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {30064#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {30064#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {30064#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {30064#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {30064#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {30064#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {30064#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {30064#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {30064#false} ~skip~0 := 0; {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {30064#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {30064#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {30064#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {30064#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {30064#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {30064#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {30064#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {30064#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {30064#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {30064#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {30064#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {30064#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {30064#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {30064#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {30064#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {30064#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {30064#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {30064#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {30064#false} assume 8544 == #t~mem64;havoc #t~mem64; {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 80: Hoare triple {30064#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 81: Hoare triple {30064#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 82: Hoare triple {30064#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 83: Hoare triple {30064#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {30064#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {30064#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 86: Hoare triple {30064#false} assume 8 == ~blastFlag~0; {30064#false} is VALID [2022-04-28 15:21:52,238 INFO L290 TraceCheckUtils]: 87: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-28 15:21:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:21:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54124167] [2022-04-28 15:21:52,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54124167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:52,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:52,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:52,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:52,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896594665] [2022-04-28 15:21:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896594665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:52,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:52,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:52,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866853141] [2022-04-28 15:21:52,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-04-28 15:21:52,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:52,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:21:52,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:21:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:52,321 INFO L87 Difference]: Start difference. First operand 287 states and 448 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:21:55,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:59,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:02,175 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 15:22:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:04,988 INFO L93 Difference]: Finished difference Result 624 states and 972 transitions. [2022-04-28 15:22:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:04,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-04-28 15:22:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:22:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:22:04,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:22:05,385 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 15:22:05,391 INFO L225 Difference]: With dead ends: 624 [2022-04-28 15:22:05,391 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 15:22:05,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:05,392 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:05,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:22:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 15:22:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 287. [2022-04-28 15:22:05,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:05,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:05,409 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:05,409 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:05,416 INFO L93 Difference]: Finished difference Result 363 states and 551 transitions. [2022-04-28 15:22:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2022-04-28 15:22:05,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:05,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:05,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 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 363 states. [2022-04-28 15:22:05,418 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 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 363 states. [2022-04-28 15:22:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:05,425 INFO L93 Difference]: Finished difference Result 363 states and 551 transitions. [2022-04-28 15:22:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2022-04-28 15:22:05,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:05,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:05,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:05,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-28 15:22:05,432 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-28 15:22:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:05,432 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-28 15:22:05,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:05,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-28 15:22:05,779 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 15:22:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-28 15:22:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:22:05,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:05,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-04-28 15:22:05,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:22:05,781 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 1 times [2022-04-28 15:22:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:05,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295493893] [2022-04-28 15:22:05,835 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:05,835 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 2 times [2022-04-28 15:22:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387023502] [2022-04-28 15:22:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:05,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {32630#(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(196, 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); {32623#true} is VALID [2022-04-28 15:22:05,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {32623#true} assume true; {32623#true} is VALID [2022-04-28 15:22:05,949 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32623#true} {32623#true} #689#return; {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {32623#true} call ULTIMATE.init(); {32630#(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 15:22:05,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {32630#(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(196, 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); {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {32623#true} assume true; {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32623#true} {32623#true} #689#return; {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {32623#true} call #t~ret161 := main(); {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {32623#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {32623#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L272 TraceCheckUtils]: 7: Hoare triple {32623#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32623#true} is VALID [2022-04-28 15:22:05,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {32623#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {32623#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {32623#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {32623#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {32623#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {32623#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {32623#true} assume !false; {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {32623#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {32623#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {32623#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {32623#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {32623#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {32623#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {32623#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {32623#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {32623#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32623#true} is VALID [2022-04-28 15:22:05,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {32623#true} assume 8464 == #t~mem55;havoc #t~mem55; {32623#true} is VALID [2022-04-28 15:22:05,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {32623#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32623#true} is VALID [2022-04-28 15:22:05,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {32623#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32623#true} is VALID [2022-04-28 15:22:05,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {32623#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:05,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {32628#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32629#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:22:05,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {32629#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {32624#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {32624#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {32624#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {32624#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {32624#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {32624#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {32624#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {32624#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {32624#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {32624#false} assume 8448 == #t~mem68;havoc #t~mem68; {32624#false} is VALID [2022-04-28 15:22:05,971 INFO L290 TraceCheckUtils]: 55: Hoare triple {32624#false} assume !(~num1~0 > 0); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {32624#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {32624#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {32624#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 59: Hoare triple {32624#false} ~skip~0 := 0; {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {32624#false} assume !false; {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {32624#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {32624#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {32624#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {32624#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {32624#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {32624#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 67: Hoare triple {32624#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {32624#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {32624#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 70: Hoare triple {32624#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 71: Hoare triple {32624#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 72: Hoare triple {32624#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 73: Hoare triple {32624#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {32624#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {32624#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 76: Hoare triple {32624#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {32624#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {32624#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {32624#false} assume 8544 == #t~mem64;havoc #t~mem64; {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {32624#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {32624#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 82: Hoare triple {32624#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 83: Hoare triple {32624#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {32624#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32624#false} is VALID [2022-04-28 15:22:05,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {32624#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {32624#false} is VALID [2022-04-28 15:22:05,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {32624#false} assume 8 == ~blastFlag~0; {32624#false} is VALID [2022-04-28 15:22:05,975 INFO L290 TraceCheckUtils]: 87: Hoare triple {32624#false} assume !false; {32624#false} is VALID [2022-04-28 15:22:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 15:22:05,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:05,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387023502] [2022-04-28 15:22:05,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387023502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:05,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:05,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:05,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295493893] [2022-04-28 15:22:05,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295493893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:05,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:05,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314252235] [2022-04-28 15:22:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:05,977 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 88 [2022-04-28 15:22:05,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:05,977 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 15:22:06,041 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 15:22:06,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:06,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:06,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:06,042 INFO L87 Difference]: Start difference. First operand 287 states and 445 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 15:22:10,370 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 15:22:12,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:14,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:15,337 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-28 15:22:15,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:15,337 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 88 [2022-04-28 15:22:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:15,338 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 15:22:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:22:15,340 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 15:22:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:22:15,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:22:15,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:15,640 INFO L225 Difference]: With dead ends: 590 [2022-04-28 15:22:15,640 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:22:15,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:15,641 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:15,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 393 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:22:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:22:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:22:15,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:15,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:15,667 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:15,668 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:15,674 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:22:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:22:15,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:15,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:15,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 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 329 states. [2022-04-28 15:22:15,675 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 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 329 states. [2022-04-28 15:22:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:15,681 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:22:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:22:15,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:15,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:15,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:15,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-28 15:22:15,689 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-28 15:22:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:15,690 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-28 15:22:15,690 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 15:22:15,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-28 15:22:16,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-28 15:22:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 15:22:16,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:16,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 15:22:16,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:22:16,137 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 1 times [2022-04-28 15:22:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1202545735] [2022-04-28 15:22:16,198 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:16,198 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 2 times [2022-04-28 15:22:16,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536069354] [2022-04-28 15:22:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:16,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:16,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {35098#(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(196, 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); {35091#true} is VALID [2022-04-28 15:22:16,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {35091#true} assume true; {35091#true} is VALID [2022-04-28 15:22:16,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35091#true} {35091#true} #689#return; {35091#true} is VALID [2022-04-28 15:22:16,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {35091#true} call ULTIMATE.init(); {35098#(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 15:22:16,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {35098#(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(196, 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); {35091#true} is VALID [2022-04-28 15:22:16,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {35091#true} assume true; {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35091#true} {35091#true} #689#return; {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {35091#true} call #t~ret161 := main(); {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {35091#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {35091#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L272 TraceCheckUtils]: 7: Hoare triple {35091#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {35091#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {35091#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {35091#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {35091#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35091#true} is VALID [2022-04-28 15:22:16,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {35091#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {35091#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {35091#true} assume !false; {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {35091#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {35091#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {35091#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {35091#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {35091#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {35091#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {35091#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {35091#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {35091#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35091#true} is VALID [2022-04-28 15:22:16,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {35091#true} assume 8464 == #t~mem55;havoc #t~mem55; {35091#true} is VALID [2022-04-28 15:22:16,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {35091#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35091#true} is VALID [2022-04-28 15:22:16,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {35091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35091#true} is VALID [2022-04-28 15:22:16,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {35091#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:16,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {35096#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35097#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {35097#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {35092#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {35092#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {35092#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {35092#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {35092#false} ~skip~0 := 0; {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {35092#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {35092#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {35092#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {35092#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {35092#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {35092#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {35092#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {35092#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {35092#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {35092#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {35092#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {35092#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {35092#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {35092#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {35092#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {35092#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {35092#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {35092#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {35092#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {35092#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {35092#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {35092#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {35092#false} assume 8448 == #t~mem68;havoc #t~mem68; {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {35092#false} assume !(~num1~0 > 0); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {35092#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {35092#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {35092#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {35092#false} ~skip~0 := 0; {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {35092#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {35092#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {35092#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {35092#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {35092#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 79: Hoare triple {35092#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {35092#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 81: Hoare triple {35092#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {35092#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 83: Hoare triple {35092#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 84: Hoare triple {35092#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 85: Hoare triple {35092#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 86: Hoare triple {35092#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 87: Hoare triple {35092#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {35092#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 89: Hoare triple {35092#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 90: Hoare triple {35092#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 91: Hoare triple {35092#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 92: Hoare triple {35092#false} assume 8544 == #t~mem64;havoc #t~mem64; {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 93: Hoare triple {35092#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 94: Hoare triple {35092#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 95: Hoare triple {35092#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 96: Hoare triple {35092#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 97: Hoare triple {35092#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 98: Hoare triple {35092#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {35092#false} is VALID [2022-04-28 15:22:16,343 INFO L290 TraceCheckUtils]: 99: Hoare triple {35092#false} assume 8 == ~blastFlag~0; {35092#false} is VALID [2022-04-28 15:22:16,344 INFO L290 TraceCheckUtils]: 100: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:22:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:22:16,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536069354] [2022-04-28 15:22:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536069354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:16,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:16,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:16,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1202545735] [2022-04-28 15:22:16,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1202545735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:16,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:16,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:16,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045497850] [2022-04-28 15:22:16,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 101 [2022-04-28 15:22:16,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:16,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 15:22:16,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:16,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:16,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:16,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:16,407 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 15:22:19,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:25,582 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 15:22:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:26,533 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-28 15:22:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 101 [2022-04-28 15:22:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 15:22:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:22:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 15:22:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:22:26,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 15:22:26,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:26,836 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:22:26,836 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:22:26,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:26,837 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:26,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:22:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:22:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:22:26,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:26,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:26,849 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:26,849 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:26,854 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:22:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:22:26,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:26,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:26,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 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 329 states. [2022-04-28 15:22:26,856 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 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 329 states. [2022-04-28 15:22:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:26,862 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:22:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:22:26,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:26,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:26,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:26,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-28 15:22:26,870 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-28 15:22:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:26,870 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-28 15:22:26,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 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 15:22:26,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-28 15:22:27,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-28 15:22:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:22:27,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:27,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-28 15:22:27,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:22:27,253 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:27,253 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 1 times [2022-04-28 15:22:27,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2097584193] [2022-04-28 15:22:27,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:27,322 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 2 times [2022-04-28 15:22:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712927079] [2022-04-28 15:22:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:27,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {37610#(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(196, 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); {37603#true} is VALID [2022-04-28 15:22:27,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {37603#true} assume true; {37603#true} is VALID [2022-04-28 15:22:27,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37603#true} {37603#true} #689#return; {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {37603#true} call ULTIMATE.init(); {37610#(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 15:22:27,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {37610#(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(196, 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); {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {37603#true} assume true; {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37603#true} {37603#true} #689#return; {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {37603#true} call #t~ret161 := main(); {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {37603#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37603#true} is VALID [2022-04-28 15:22:27,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {37603#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L272 TraceCheckUtils]: 7: Hoare triple {37603#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {37603#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {37603#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {37603#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {37603#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {37603#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {37603#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {37603#true} is VALID [2022-04-28 15:22:27,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {37603#true} assume !false; {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {37603#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {37603#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {37603#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {37603#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {37603#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {37603#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {37603#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {37603#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {37603#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37603#true} is VALID [2022-04-28 15:22:27,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#true} assume 8464 == #t~mem55;havoc #t~mem55; {37603#true} is VALID [2022-04-28 15:22:27,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {37603#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37603#true} is VALID [2022-04-28 15:22:27,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {37603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37603#true} is VALID [2022-04-28 15:22:27,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {37603#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,448 INFO L290 TraceCheckUtils]: 30: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,449 INFO L290 TraceCheckUtils]: 33: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {37608#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37609#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {37609#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {37604#false} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {37604#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37604#false} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {37604#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {37604#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {37604#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37604#false} is VALID [2022-04-28 15:22:27,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {37604#false} ~skip~0 := 0; {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {37604#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {37604#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {37604#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {37604#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {37604#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {37604#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {37604#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {37604#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {37604#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {37604#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {37604#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {37604#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {37604#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {37604#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {37604#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {37604#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {37604#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {37604#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {37604#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {37604#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {37604#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {37604#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {37604#false} assume 8448 == #t~mem68;havoc #t~mem68; {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {37604#false} assume !(~num1~0 > 0); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 70: Hoare triple {37604#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {37604#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {37604#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {37604#false} ~skip~0 := 0; {37604#false} is VALID [2022-04-28 15:22:27,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {37604#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {37604#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {37604#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 78: Hoare triple {37604#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 79: Hoare triple {37604#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 80: Hoare triple {37604#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {37604#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 82: Hoare triple {37604#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 83: Hoare triple {37604#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 84: Hoare triple {37604#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {37604#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {37604#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 87: Hoare triple {37604#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {37604#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 89: Hoare triple {37604#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {37604#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {37604#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 92: Hoare triple {37604#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 93: Hoare triple {37604#false} assume 8544 == #t~mem64;havoc #t~mem64; {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 94: Hoare triple {37604#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {37604#false} is VALID [2022-04-28 15:22:27,457 INFO L290 TraceCheckUtils]: 95: Hoare triple {37604#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 96: Hoare triple {37604#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 97: Hoare triple {37604#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 98: Hoare triple {37604#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 99: Hoare triple {37604#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 100: Hoare triple {37604#false} assume 8 == ~blastFlag~0; {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L290 TraceCheckUtils]: 101: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:22:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:22:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:27,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712927079] [2022-04-28 15:22:27,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712927079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:27,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:27,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:27,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:27,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2097584193] [2022-04-28 15:22:27,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2097584193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:27,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:27,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101498334] [2022-04-28 15:22:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 102 [2022-04-28 15:22:27,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:27,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:27,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:27,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:27,531 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:37,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:39,191 INFO L93 Difference]: Finished difference Result 668 states and 1032 transitions. [2022-04-28 15:22:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:39,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 102 [2022-04-28 15:22:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:22:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:22:39,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-28 15:22:39,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 585 edges. 585 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:39,587 INFO L225 Difference]: With dead ends: 668 [2022-04-28 15:22:39,587 INFO L226 Difference]: Without dead ends: 385 [2022-04-28 15:22:39,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:39,588 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 136 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:39,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:22:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-04-28 15:22:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 309. [2022-04-28 15:22:39,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:39,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 385 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:39,607 INFO L74 IsIncluded]: Start isIncluded. First operand 385 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:39,607 INFO L87 Difference]: Start difference. First operand 385 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:39,615 INFO L93 Difference]: Finished difference Result 385 states and 579 transitions. [2022-04-28 15:22:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 579 transitions. [2022-04-28 15:22:39,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:39,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:39,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 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 385 states. [2022-04-28 15:22:39,617 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 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 385 states. [2022-04-28 15:22:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:39,625 INFO L93 Difference]: Finished difference Result 385 states and 579 transitions. [2022-04-28 15:22:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 579 transitions. [2022-04-28 15:22:39,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:39,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:39,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:39,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-28 15:22:39,633 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-28 15:22:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:39,633 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-28 15:22:39,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:39,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-28 15:22:40,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-28 15:22:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:22:40,029 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:40,029 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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 15:22:40,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:22:40,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 1 times [2022-04-28 15:22:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:40,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1521894574] [2022-04-28 15:22:40,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:40,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 2 times [2022-04-28 15:22:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:40,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245616063] [2022-04-28 15:22:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:40,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:40,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {40346#(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(196, 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); {40339#true} is VALID [2022-04-28 15:22:40,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {40339#true} assume true; {40339#true} is VALID [2022-04-28 15:22:40,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40339#true} {40339#true} #689#return; {40339#true} is VALID [2022-04-28 15:22:40,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {40339#true} call ULTIMATE.init(); {40346#(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 15:22:40,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {40346#(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(196, 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); {40339#true} is VALID [2022-04-28 15:22:40,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {40339#true} assume true; {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40339#true} {40339#true} #689#return; {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {40339#true} call #t~ret161 := main(); {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {40339#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {40339#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L272 TraceCheckUtils]: 7: Hoare triple {40339#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {40339#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {40339#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {40339#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {40339#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40339#true} is VALID [2022-04-28 15:22:40,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {40339#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {40339#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {40339#true} assume !false; {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {40339#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {40339#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {40339#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {40339#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {40339#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {40339#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {40339#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {40339#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {40339#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40339#true} is VALID [2022-04-28 15:22:40,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {40339#true} assume 8464 == #t~mem55;havoc #t~mem55; {40339#true} is VALID [2022-04-28 15:22:40,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {40339#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40339#true} is VALID [2022-04-28 15:22:40,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {40339#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40339#true} is VALID [2022-04-28 15:22:40,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {40339#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,209 INFO L290 TraceCheckUtils]: 38: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:22:40,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {40344#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40345#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:22:40,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {40345#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {40340#false} is VALID [2022-04-28 15:22:40,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {40340#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {40340#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {40340#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {40340#false} ~skip~0 := 0; {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {40340#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {40340#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {40340#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {40340#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {40340#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {40340#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {40340#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {40340#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {40340#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {40340#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 56: Hoare triple {40340#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 57: Hoare triple {40340#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {40340#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {40340#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {40340#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {40340#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {40340#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {40340#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {40340#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {40340#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {40340#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 67: Hoare triple {40340#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {40340#false} assume 8448 == #t~mem68;havoc #t~mem68; {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {40340#false} assume !(~num1~0 > 0); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 70: Hoare triple {40340#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 71: Hoare triple {40340#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,212 INFO L290 TraceCheckUtils]: 72: Hoare triple {40340#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 73: Hoare triple {40340#false} ~skip~0 := 0; {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 74: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {40340#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {40340#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {40340#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {40340#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {40340#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {40340#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {40340#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {40340#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {40340#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 84: Hoare triple {40340#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 85: Hoare triple {40340#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 86: Hoare triple {40340#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 87: Hoare triple {40340#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 88: Hoare triple {40340#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 89: Hoare triple {40340#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 90: Hoare triple {40340#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,214 INFO L290 TraceCheckUtils]: 91: Hoare triple {40340#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 92: Hoare triple {40340#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 93: Hoare triple {40340#false} assume 8544 == #t~mem64;havoc #t~mem64; {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 94: Hoare triple {40340#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 95: Hoare triple {40340#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 96: Hoare triple {40340#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 97: Hoare triple {40340#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 98: Hoare triple {40340#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 99: Hoare triple {40340#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {40340#false} is VALID [2022-04-28 15:22:40,215 INFO L290 TraceCheckUtils]: 100: Hoare triple {40340#false} assume 8 == ~blastFlag~0; {40340#false} is VALID [2022-04-28 15:22:40,216 INFO L290 TraceCheckUtils]: 101: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:22:40,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:40,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245616063] [2022-04-28 15:22:40,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245616063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:40,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:40,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:40,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:40,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1521894574] [2022-04-28 15:22:40,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1521894574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:40,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:40,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:40,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212476173] [2022-04-28 15:22:40,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:40,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 102 [2022-04-28 15:22:40,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:40,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:40,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:40,284 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:42,304 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 15:22:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:43,245 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-28 15:22:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 102 [2022-04-28 15:22:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:22:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:22:43,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:22:43,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:43,549 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:22:43,549 INFO L226 Difference]: Without dead ends: 326 [2022-04-28 15:22:43,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:43,550 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:43,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:22:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-28 15:22:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-28 15:22:43,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:43,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:43,568 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:43,568 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:43,574 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:22:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:22:43,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:43,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:43,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 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 326 states. [2022-04-28 15:22:43,576 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 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 326 states. [2022-04-28 15:22:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:43,583 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:22:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:22:43,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:43,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:43,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:43,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-28 15:22:43,591 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-28 15:22:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:43,591 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-28 15:22:43,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 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 15:22:43,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-28 15:22:44,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-28 15:22:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 15:22:44,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:44,047 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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 15:22:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:22:44,047 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 1 times [2022-04-28 15:22:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370938071] [2022-04-28 15:22:44,132 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:44,132 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 2 times [2022-04-28 15:22:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869508052] [2022-04-28 15:22:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:44,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:44,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {42846#(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(196, 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); {42839#true} is VALID [2022-04-28 15:22:44,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {42839#true} assume true; {42839#true} is VALID [2022-04-28 15:22:44,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42839#true} {42839#true} #689#return; {42839#true} is VALID [2022-04-28 15:22:44,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {42839#true} call ULTIMATE.init(); {42846#(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 15:22:44,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {42846#(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(196, 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); {42839#true} is VALID [2022-04-28 15:22:44,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {42839#true} assume true; {42839#true} is VALID [2022-04-28 15:22:44,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42839#true} {42839#true} #689#return; {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {42839#true} call #t~ret161 := main(); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {42839#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {42839#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L272 TraceCheckUtils]: 7: Hoare triple {42839#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {42839#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {42839#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {42839#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {42839#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {42839#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {42839#true} is VALID [2022-04-28 15:22:44,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {42839#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {42839#true} assume !false; {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {42839#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {42839#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {42839#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {42839#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {42839#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {42839#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {42839#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {42839#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {42839#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {42839#true} assume 8464 == #t~mem55;havoc #t~mem55; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {42839#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {42839#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {42839#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {42839#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {42839#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {42839#true} ~skip~0 := 0; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {42839#true} assume !false; {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {42839#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 33: Hoare triple {42839#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {42839#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {42839#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {42839#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 37: Hoare triple {42839#true} assume 8195 == #t~mem51;havoc #t~mem51; {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {42839#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {42839#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {42839#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {42839#true} 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, 80 + ~s.offset, 8); {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {42839#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {42839#true} is VALID [2022-04-28 15:22:44,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {42839#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {42839#true} is VALID [2022-04-28 15:22:44,276 INFO L290 TraceCheckUtils]: 44: Hoare triple {42839#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,277 INFO L290 TraceCheckUtils]: 46: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,279 INFO L290 TraceCheckUtils]: 50: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,279 INFO L290 TraceCheckUtils]: 51: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:22:44,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {42844#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42845#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {42845#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {42840#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {42840#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {42840#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {42840#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {42840#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {42840#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {42840#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {42840#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {42840#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {42840#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {42840#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {42840#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {42840#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {42840#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {42840#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 71: Hoare triple {42840#false} assume 8448 == #t~mem68;havoc #t~mem68; {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 72: Hoare triple {42840#false} assume !(~num1~0 > 0); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 73: Hoare triple {42840#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 74: Hoare triple {42840#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,282 INFO L290 TraceCheckUtils]: 75: Hoare triple {42840#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 76: Hoare triple {42840#false} ~skip~0 := 0; {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 77: Hoare triple {42840#false} assume !false; {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 78: Hoare triple {42840#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 79: Hoare triple {42840#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 80: Hoare triple {42840#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 81: Hoare triple {42840#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {42840#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 83: Hoare triple {42840#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 84: Hoare triple {42840#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 85: Hoare triple {42840#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,283 INFO L290 TraceCheckUtils]: 86: Hoare triple {42840#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 87: Hoare triple {42840#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 88: Hoare triple {42840#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {42840#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {42840#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 91: Hoare triple {42840#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 92: Hoare triple {42840#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 93: Hoare triple {42840#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 94: Hoare triple {42840#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 95: Hoare triple {42840#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 96: Hoare triple {42840#false} assume 8544 == #t~mem64;havoc #t~mem64; {42840#false} is VALID [2022-04-28 15:22:44,284 INFO L290 TraceCheckUtils]: 97: Hoare triple {42840#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 98: Hoare triple {42840#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 99: Hoare triple {42840#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 100: Hoare triple {42840#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 101: Hoare triple {42840#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {42840#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 103: Hoare triple {42840#false} assume 8 == ~blastFlag~0; {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L290 TraceCheckUtils]: 104: Hoare triple {42840#false} assume !false; {42840#false} is VALID [2022-04-28 15:22:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 15:22:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:44,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869508052] [2022-04-28 15:22:44,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869508052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:44,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:44,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370938071] [2022-04-28 15:22:44,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370938071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259867187] [2022-04-28 15:22:44,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 105 [2022-04-28 15:22:44,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:44,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:44,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:44,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:44,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:44,364 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:46,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:48,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:53,353 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-28 15:22:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:53,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 105 [2022-04-28 15:22:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:22:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:22:53,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:22:53,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:53,651 INFO L225 Difference]: With dead ends: 620 [2022-04-28 15:22:53,651 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:22:53,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:22:53,664 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:53,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 15:22:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:22:53,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 15:22:53,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:53,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:53,689 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:53,689 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:53,695 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:22:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:22:53,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:53,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:53,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:22:53,697 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 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 337 states. [2022-04-28 15:22:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:53,704 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:22:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:22:53,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:53,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:53,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:53,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:53,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:22:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-28 15:22:53,712 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-28 15:22:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:53,712 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-28 15:22:53,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 15:22:53,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-28 15:22:54,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-28 15:22:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 15:22:54,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:54,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-04-28 15:22:54,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:22:54,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 1 times [2022-04-28 15:22:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:54,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569024525] [2022-04-28 15:22:54,259 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:54,259 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 2 times [2022-04-28 15:22:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:54,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054363761] [2022-04-28 15:22:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:54,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {45422#(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(196, 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); {45415#true} is VALID [2022-04-28 15:22:54,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {45415#true} assume true; {45415#true} is VALID [2022-04-28 15:22:54,405 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45415#true} {45415#true} #689#return; {45415#true} is VALID [2022-04-28 15:22:54,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {45415#true} call ULTIMATE.init(); {45422#(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 15:22:54,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {45422#(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(196, 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); {45415#true} is VALID [2022-04-28 15:22:54,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {45415#true} assume true; {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45415#true} {45415#true} #689#return; {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {45415#true} call #t~ret161 := main(); {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {45415#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {45415#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {45415#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {45415#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {45415#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {45415#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {45415#true} is VALID [2022-04-28 15:22:54,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {45415#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {45415#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {45415#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {45415#true} assume !false; {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {45415#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {45415#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {45415#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {45415#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {45415#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {45415#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {45415#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {45415#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {45415#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45415#true} is VALID [2022-04-28 15:22:54,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {45415#true} assume 8464 == #t~mem55;havoc #t~mem55; {45415#true} is VALID [2022-04-28 15:22:54,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {45415#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45415#true} is VALID [2022-04-28 15:22:54,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {45415#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45415#true} is VALID [2022-04-28 15:22:54,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {45415#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,411 INFO L290 TraceCheckUtils]: 29: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {45420#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45421#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {45421#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {45416#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {45416#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {45416#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {45416#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, 80 + ~s.offset, 8); {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {45416#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {45416#false} is VALID [2022-04-28 15:22:54,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {45416#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {45416#false} assume 12292 != #t~mem85;havoc #t~mem85; {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {45416#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {45416#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {45416#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {45416#false} ~skip~0 := 0; {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {45416#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {45416#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {45416#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {45416#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {45416#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {45416#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {45416#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {45416#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {45416#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {45416#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 60: Hoare triple {45416#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {45416#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {45416#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {45416#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,416 INFO L290 TraceCheckUtils]: 64: Hoare triple {45416#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {45416#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {45416#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 67: Hoare triple {45416#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {45416#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {45416#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,417 INFO L290 TraceCheckUtils]: 70: Hoare triple {45416#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {45416#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {45416#false} assume 8448 == #t~mem68;havoc #t~mem68; {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {45416#false} assume !(~num1~0 > 0); {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 74: Hoare triple {45416#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 75: Hoare triple {45416#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 76: Hoare triple {45416#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 77: Hoare triple {45416#false} ~skip~0 := 0; {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 78: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {45416#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {45416#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {45416#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {45416#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {45416#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {45416#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {45416#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {45416#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 87: Hoare triple {45416#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {45416#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {45416#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 90: Hoare triple {45416#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,419 INFO L290 TraceCheckUtils]: 91: Hoare triple {45416#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {45416#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {45416#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {45416#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 95: Hoare triple {45416#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 96: Hoare triple {45416#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 97: Hoare triple {45416#false} assume 8544 == #t~mem64;havoc #t~mem64; {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {45416#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 99: Hoare triple {45416#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 100: Hoare triple {45416#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {45416#false} is VALID [2022-04-28 15:22:54,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {45416#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {45416#false} is VALID [2022-04-28 15:22:54,421 INFO L290 TraceCheckUtils]: 102: Hoare triple {45416#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {45416#false} is VALID [2022-04-28 15:22:54,421 INFO L290 TraceCheckUtils]: 103: Hoare triple {45416#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {45416#false} is VALID [2022-04-28 15:22:54,421 INFO L290 TraceCheckUtils]: 104: Hoare triple {45416#false} assume 8 == ~blastFlag~0; {45416#false} is VALID [2022-04-28 15:22:54,421 INFO L290 TraceCheckUtils]: 105: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:22:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054363761] [2022-04-28 15:22:54,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054363761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:54,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:54,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:54,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:54,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569024525] [2022-04-28 15:22:54,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569024525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:54,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:54,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664082088] [2022-04-28 15:22:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 106 [2022-04-28 15:22:54,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:54,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 15:22:54,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:22:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:54,489 INFO L87 Difference]: Start difference. First operand 325 states and 494 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 15:22:59,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:02,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:04,102 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 15:23:05,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:05,278 INFO L93 Difference]: Finished difference Result 690 states and 1051 transitions. [2022-04-28 15:23:05,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:05,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 106 [2022-04-28 15:23:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:05,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 15:23:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:23:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 15:23:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:23:05,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-28 15:23:05,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:05,667 INFO L225 Difference]: With dead ends: 690 [2022-04-28 15:23:05,667 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 15:23:05,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 15:23:05,668 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 130 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:05,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 408 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 15:23:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 15:23:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 325. [2022-04-28 15:23:05,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:05,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:05,688 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:05,688 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:05,696 INFO L93 Difference]: Finished difference Result 391 states and 581 transitions. [2022-04-28 15:23:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 581 transitions. [2022-04-28 15:23:05,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:05,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:05,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-28 15:23:05,698 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 391 states. [2022-04-28 15:23:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:05,706 INFO L93 Difference]: Finished difference Result 391 states and 581 transitions. [2022-04-28 15:23:05,706 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 581 transitions. [2022-04-28 15:23:05,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:05,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:05,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:05,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-28 15:23:05,714 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-28 15:23:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:05,715 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-28 15:23:05,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 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 15:23:05,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-28 15:23:06,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-28 15:23:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 15:23:06,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:06,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:06,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:23:06,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 1 times [2022-04-28 15:23:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:06,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646286183] [2022-04-28 15:23:06,220 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:06,220 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 2 times [2022-04-28 15:23:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:06,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587158095] [2022-04-28 15:23:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:06,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:06,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {48246#(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(196, 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); {48239#true} is VALID [2022-04-28 15:23:06,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {48239#true} assume true; {48239#true} is VALID [2022-04-28 15:23:06,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48239#true} {48239#true} #689#return; {48239#true} is VALID [2022-04-28 15:23:06,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {48239#true} call ULTIMATE.init(); {48246#(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 15:23:06,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {48246#(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(196, 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); {48239#true} is VALID [2022-04-28 15:23:06,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {48239#true} assume true; {48239#true} is VALID [2022-04-28 15:23:06,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48239#true} {48239#true} #689#return; {48239#true} is VALID [2022-04-28 15:23:06,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {48239#true} call #t~ret161 := main(); {48239#true} is VALID [2022-04-28 15:23:06,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {48239#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {48239#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L272 TraceCheckUtils]: 7: Hoare triple {48239#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {48239#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {48239#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {48239#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {48239#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {48239#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {48239#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {48239#true} assume !false; {48239#true} is VALID [2022-04-28 15:23:06,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {48239#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {48239#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {48239#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {48239#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {48239#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {48239#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {48239#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {48239#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {48239#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {48239#true} assume 8464 == #t~mem55;havoc #t~mem55; {48239#true} is VALID [2022-04-28 15:23:06,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {48239#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {48239#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {48239#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {48239#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {48239#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {48239#true} ~skip~0 := 0; {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {48239#true} assume !false; {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {48239#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {48239#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {48239#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {48239#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,353 INFO L290 TraceCheckUtils]: 36: Hoare triple {48239#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {48239#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {48239#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 39: Hoare triple {48239#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {48239#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {48239#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {48239#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {48239#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {48239#true} assume 8496 == #t~mem58;havoc #t~mem58; {48239#true} is VALID [2022-04-28 15:23:06,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {48239#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48239#true} is VALID [2022-04-28 15:23:06,355 INFO L290 TraceCheckUtils]: 46: Hoare triple {48239#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48239#true} is VALID [2022-04-28 15:23:06,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {48239#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {48239#true} is VALID [2022-04-28 15:23:06,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {48239#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,357 INFO L290 TraceCheckUtils]: 49: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,357 INFO L290 TraceCheckUtils]: 50: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,358 INFO L290 TraceCheckUtils]: 52: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,358 INFO L290 TraceCheckUtils]: 53: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,359 INFO L290 TraceCheckUtils]: 54: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,359 INFO L290 TraceCheckUtils]: 55: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,362 INFO L290 TraceCheckUtils]: 61: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,362 INFO L290 TraceCheckUtils]: 62: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,363 INFO L290 TraceCheckUtils]: 63: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,363 INFO L290 TraceCheckUtils]: 64: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,363 INFO L290 TraceCheckUtils]: 65: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,364 INFO L290 TraceCheckUtils]: 66: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,364 INFO L290 TraceCheckUtils]: 67: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,365 INFO L290 TraceCheckUtils]: 68: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,365 INFO L290 TraceCheckUtils]: 70: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,366 INFO L290 TraceCheckUtils]: 71: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,366 INFO L290 TraceCheckUtils]: 72: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,367 INFO L290 TraceCheckUtils]: 73: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,367 INFO L290 TraceCheckUtils]: 74: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:23:06,367 INFO L290 TraceCheckUtils]: 75: Hoare triple {48244#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48245#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {48245#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {48240#false} assume !(~num1~0 > 0); {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {48240#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {48240#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {48240#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {48240#false} ~skip~0 := 0; {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {48240#false} assume !false; {48240#false} is VALID [2022-04-28 15:23:06,368 INFO L290 TraceCheckUtils]: 83: Hoare triple {48240#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 84: Hoare triple {48240#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 85: Hoare triple {48240#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 86: Hoare triple {48240#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 87: Hoare triple {48240#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {48240#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 89: Hoare triple {48240#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 90: Hoare triple {48240#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 91: Hoare triple {48240#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 92: Hoare triple {48240#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,369 INFO L290 TraceCheckUtils]: 93: Hoare triple {48240#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 94: Hoare triple {48240#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 95: Hoare triple {48240#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 96: Hoare triple {48240#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 97: Hoare triple {48240#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 98: Hoare triple {48240#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 99: Hoare triple {48240#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 100: Hoare triple {48240#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 101: Hoare triple {48240#false} assume 8544 == #t~mem64;havoc #t~mem64; {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 102: Hoare triple {48240#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 103: Hoare triple {48240#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {48240#false} is VALID [2022-04-28 15:23:06,370 INFO L290 TraceCheckUtils]: 104: Hoare triple {48240#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {48240#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L290 TraceCheckUtils]: 106: Hoare triple {48240#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L290 TraceCheckUtils]: 107: Hoare triple {48240#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L290 TraceCheckUtils]: 108: Hoare triple {48240#false} assume 8 == ~blastFlag~0; {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L290 TraceCheckUtils]: 109: Hoare triple {48240#false} assume !false; {48240#false} is VALID [2022-04-28 15:23:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:23:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587158095] [2022-04-28 15:23:06,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587158095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:06,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:06,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:06,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:06,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646286183] [2022-04-28 15:23:06,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646286183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:06,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436678528] [2022-04-28 15:23:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 110 [2022-04-28 15:23:06,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:06,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 15:23:06,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:06,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:06,456 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 15:23:11,715 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 15:23:13,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:14,901 INFO L93 Difference]: Finished difference Result 766 states and 1161 transitions. [2022-04-28 15:23:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:14,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 110 [2022-04-28 15:23:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 15:23:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:23:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 15:23:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:23:14,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:23:15,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:15,283 INFO L225 Difference]: With dead ends: 766 [2022-04-28 15:23:15,283 INFO L226 Difference]: Without dead ends: 467 [2022-04-28 15:23:15,284 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 15:23:15,284 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 111 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:15,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:23:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-04-28 15:23:15,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 389. [2022-04-28 15:23:15,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:15,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:15,309 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:15,310 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:15,320 INFO L93 Difference]: Finished difference Result 467 states and 701 transitions. [2022-04-28 15:23:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 701 transitions. [2022-04-28 15:23:15,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:15,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:15,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 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 467 states. [2022-04-28 15:23:15,322 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 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 467 states. [2022-04-28 15:23:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:15,333 INFO L93 Difference]: Finished difference Result 467 states and 701 transitions. [2022-04-28 15:23:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 701 transitions. [2022-04-28 15:23:15,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:15,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:15,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:15,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-28 15:23:15,344 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-28 15:23:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:15,345 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-28 15:23:15,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 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 15:23:15,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-28 15:23:15,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-28 15:23:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 15:23:15,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:15,966 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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 15:23:15,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:23:15,967 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 1 times [2022-04-28 15:23:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:15,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1124800314] [2022-04-28 15:23:16,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:16,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 2 times [2022-04-28 15:23:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:16,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304053774] [2022-04-28 15:23:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:16,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:16,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {51502#(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(196, 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); {51495#true} is VALID [2022-04-28 15:23:16,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {51495#true} assume true; {51495#true} is VALID [2022-04-28 15:23:16,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51495#true} {51495#true} #689#return; {51495#true} is VALID [2022-04-28 15:23:16,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {51495#true} call ULTIMATE.init(); {51502#(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 15:23:16,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {51502#(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(196, 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); {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {51495#true} assume true; {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51495#true} {51495#true} #689#return; {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {51495#true} call #t~ret161 := main(); {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {51495#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {51495#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L272 TraceCheckUtils]: 7: Hoare triple {51495#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {51495#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {51495#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {51495#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {51495#true} is VALID [2022-04-28 15:23:16,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {51495#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {51495#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {51495#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {51495#true} assume !false; {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {51495#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {51495#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {51495#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {51495#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {51495#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {51495#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {51495#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {51495#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {51495#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {51495#true} assume 8464 == #t~mem55;havoc #t~mem55; {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {51495#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {51495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {51495#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {51495#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {51495#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {51495#true} ~skip~0 := 0; {51495#true} is VALID [2022-04-28 15:23:16,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {51495#true} assume !false; {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {51495#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {51495#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {51495#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {51495#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {51495#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {51495#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {51495#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 39: Hoare triple {51495#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 40: Hoare triple {51495#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 41: Hoare triple {51495#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {51495#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,194 INFO L290 TraceCheckUtils]: 43: Hoare triple {51495#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {51495#true} assume 8496 == #t~mem58;havoc #t~mem58; {51495#true} is VALID [2022-04-28 15:23:16,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {51495#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51495#true} is VALID [2022-04-28 15:23:16,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {51495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51495#true} is VALID [2022-04-28 15:23:16,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {51495#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {51495#true} is VALID [2022-04-28 15:23:16,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {51495#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,202 INFO L290 TraceCheckUtils]: 65: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,202 INFO L290 TraceCheckUtils]: 66: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,203 INFO L290 TraceCheckUtils]: 67: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,203 INFO L290 TraceCheckUtils]: 68: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,204 INFO L290 TraceCheckUtils]: 70: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,205 INFO L290 TraceCheckUtils]: 71: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,207 INFO L290 TraceCheckUtils]: 76: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,208 INFO L290 TraceCheckUtils]: 79: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:23:16,208 INFO L290 TraceCheckUtils]: 80: Hoare triple {51500#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51501#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 81: Hoare triple {51501#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 82: Hoare triple {51496#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 83: Hoare triple {51496#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {51496#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {51496#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {51496#false} ~skip~0 := 0; {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {51496#false} assume !false; {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 88: Hoare triple {51496#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {51496#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 90: Hoare triple {51496#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 91: Hoare triple {51496#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 92: Hoare triple {51496#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 93: Hoare triple {51496#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 94: Hoare triple {51496#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 95: Hoare triple {51496#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 96: Hoare triple {51496#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 97: Hoare triple {51496#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {51496#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {51496#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 100: Hoare triple {51496#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 101: Hoare triple {51496#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 102: Hoare triple {51496#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 103: Hoare triple {51496#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 104: Hoare triple {51496#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {51496#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 106: Hoare triple {51496#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 107: Hoare triple {51496#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 108: Hoare triple {51496#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,211 INFO L290 TraceCheckUtils]: 109: Hoare triple {51496#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 110: Hoare triple {51496#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 111: Hoare triple {51496#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 112: Hoare triple {51496#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 113: Hoare triple {51496#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 114: Hoare triple {51496#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 115: Hoare triple {51496#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 116: Hoare triple {51496#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 117: Hoare triple {51496#false} assume 8640 == #t~mem75;havoc #t~mem75; {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 118: Hoare triple {51496#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 119: Hoare triple {51496#false} assume 4 == ~blastFlag~0; {51496#false} is VALID [2022-04-28 15:23:16,212 INFO L290 TraceCheckUtils]: 120: Hoare triple {51496#false} assume !false; {51496#false} is VALID [2022-04-28 15:23:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:23:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:16,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304053774] [2022-04-28 15:23:16,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304053774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:16,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:16,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1124800314] [2022-04-28 15:23:16,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1124800314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:16,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:16,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900549697] [2022-04-28 15:23:16,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 121 [2022-04-28 15:23:16,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:16,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 15:23:16,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:16,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:16,304 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 15:23:22,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:24,005 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 15:23:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:27,351 INFO L93 Difference]: Finished difference Result 858 states and 1293 transitions. [2022-04-28 15:23:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 121 [2022-04-28 15:23:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 15:23:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 15:23:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:27,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:23:27,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:27,736 INFO L225 Difference]: With dead ends: 858 [2022-04-28 15:23:27,736 INFO L226 Difference]: Without dead ends: 495 [2022-04-28 15:23:27,736 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 15:23:27,737 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 107 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:27,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 392 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 15:23:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-28 15:23:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 426. [2022-04-28 15:23:27,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:27,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:27,776 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:27,777 INFO L87 Difference]: Start difference. First operand 495 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:27,788 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2022-04-28 15:23:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-04-28 15:23:27,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:27,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:27,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 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 495 states. [2022-04-28 15:23:27,790 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 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 495 states. [2022-04-28 15:23:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:27,801 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2022-04-28 15:23:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-04-28 15:23:27,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:27,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:27,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:27,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:23:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-28 15:23:27,814 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 121 [2022-04-28 15:23:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:27,815 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-28 15:23:27,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 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 15:23:27,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-28 15:23:28,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-28 15:23:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:23:28,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:28,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-28 15:23:28,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:23:28,369 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 1 times [2022-04-28 15:23:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:28,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308257906] [2022-04-28 15:23:28,446 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:28,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 2 times [2022-04-28 15:23:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:28,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792195723] [2022-04-28 15:23:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:28,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {55072#(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(196, 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); {55065#true} is VALID [2022-04-28 15:23:28,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {55065#true} assume true; {55065#true} is VALID [2022-04-28 15:23:28,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55065#true} {55065#true} #689#return; {55065#true} is VALID [2022-04-28 15:23:28,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {55065#true} call ULTIMATE.init(); {55072#(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 15:23:28,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {55072#(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(196, 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); {55065#true} is VALID [2022-04-28 15:23:28,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {55065#true} assume true; {55065#true} is VALID [2022-04-28 15:23:28,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55065#true} {55065#true} #689#return; {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {55065#true} call #t~ret161 := main(); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {55065#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {55065#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {55065#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {55065#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {55065#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {55065#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {55065#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {55065#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {55065#true} is VALID [2022-04-28 15:23:28,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {55065#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {55065#true} assume !false; {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {55065#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {55065#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {55065#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {55065#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {55065#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {55065#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {55065#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {55065#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {55065#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {55065#true} assume 8464 == #t~mem55;havoc #t~mem55; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {55065#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {55065#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {55065#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {55065#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {55065#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {55065#true} ~skip~0 := 0; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {55065#true} assume !false; {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {55065#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {55065#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {55065#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {55065#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {55065#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {55065#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {55065#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {55065#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {55065#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {55065#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {55065#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {55065#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {55065#true} assume 8496 == #t~mem58;havoc #t~mem58; {55065#true} is VALID [2022-04-28 15:23:28,599 INFO L290 TraceCheckUtils]: 45: Hoare triple {55065#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55065#true} is VALID [2022-04-28 15:23:28,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {55065#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55065#true} is VALID [2022-04-28 15:23:28,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {55065#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {55065#true} is VALID [2022-04-28 15:23:28,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {55065#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} ~skip~0 := 0; {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !false; {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,605 INFO L290 TraceCheckUtils]: 61: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,605 INFO L290 TraceCheckUtils]: 62: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,607 INFO L290 TraceCheckUtils]: 66: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,607 INFO L290 TraceCheckUtils]: 67: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,608 INFO L290 TraceCheckUtils]: 68: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,609 INFO L290 TraceCheckUtils]: 70: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,609 INFO L290 TraceCheckUtils]: 71: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,609 INFO L290 TraceCheckUtils]: 72: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,610 INFO L290 TraceCheckUtils]: 74: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,611 INFO L290 TraceCheckUtils]: 77: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,613 INFO L290 TraceCheckUtils]: 80: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:23:28,613 INFO L290 TraceCheckUtils]: 81: Hoare triple {55070#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {55071#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 15:23:28,613 INFO L290 TraceCheckUtils]: 82: Hoare triple {55071#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {55066#false} is VALID [2022-04-28 15:23:28,613 INFO L290 TraceCheckUtils]: 83: Hoare triple {55066#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {55066#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 85: Hoare triple {55066#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 86: Hoare triple {55066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 87: Hoare triple {55066#false} ~skip~0 := 0; {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 88: Hoare triple {55066#false} assume !false; {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 89: Hoare triple {55066#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 90: Hoare triple {55066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 91: Hoare triple {55066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 92: Hoare triple {55066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,614 INFO L290 TraceCheckUtils]: 93: Hoare triple {55066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {55066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 95: Hoare triple {55066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 96: Hoare triple {55066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 97: Hoare triple {55066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 98: Hoare triple {55066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 99: Hoare triple {55066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 100: Hoare triple {55066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 101: Hoare triple {55066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,615 INFO L290 TraceCheckUtils]: 102: Hoare triple {55066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {55066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 104: Hoare triple {55066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 105: Hoare triple {55066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 106: Hoare triple {55066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 107: Hoare triple {55066#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 108: Hoare triple {55066#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 109: Hoare triple {55066#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 110: Hoare triple {55066#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 111: Hoare triple {55066#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 112: Hoare triple {55066#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,616 INFO L290 TraceCheckUtils]: 113: Hoare triple {55066#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 114: Hoare triple {55066#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 115: Hoare triple {55066#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 116: Hoare triple {55066#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {55066#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 118: Hoare triple {55066#false} assume 8640 == #t~mem75;havoc #t~mem75; {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {55066#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 120: Hoare triple {55066#false} assume 4 == ~blastFlag~0; {55066#false} is VALID [2022-04-28 15:23:28,617 INFO L290 TraceCheckUtils]: 121: Hoare triple {55066#false} assume !false; {55066#false} is VALID [2022-04-28 15:23:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:23:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792195723] [2022-04-28 15:23:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792195723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:28,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:28,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:28,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:28,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308257906] [2022-04-28 15:23:28,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308257906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:28,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:28,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880900636] [2022-04-28 15:23:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 122 [2022-04-28 15:23:28,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:28,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 15:23:28,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:28,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:28,709 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 15:23:31,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:33,303 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 15:23:35,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:37,593 INFO L93 Difference]: Finished difference Result 892 states and 1343 transitions. [2022-04-28 15:23:37,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 122 [2022-04-28 15:23:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 15:23:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 15:23:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:37,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:23:37,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:37,998 INFO L225 Difference]: With dead ends: 892 [2022-04-28 15:23:37,999 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 15:23:38,000 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 15:23:38,000 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:38,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 408 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 484 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 15:23:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 15:23:38,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-28 15:23:38,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:38,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 15:23:38,032 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 15:23:38,032 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 15:23:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:38,043 INFO L93 Difference]: Finished difference Result 492 states and 731 transitions. [2022-04-28 15:23:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2022-04-28 15:23:38,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:38,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:38,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 492 states. [2022-04-28 15:23:38,044 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 492 states. [2022-04-28 15:23:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:38,055 INFO L93 Difference]: Finished difference Result 492 states and 731 transitions. [2022-04-28 15:23:38,055 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2022-04-28 15:23:38,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:38,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:38,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:38,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 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 15:23:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 638 transitions. [2022-04-28 15:23:38,068 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 638 transitions. Word has length 122 [2022-04-28 15:23:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:38,068 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 638 transitions. [2022-04-28 15:23:38,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 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 15:23:38,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 638 transitions. [2022-04-28 15:23:38,636 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 15:23:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 638 transitions. [2022-04-28 15:23:38,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:23:38,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:38,637 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1] [2022-04-28 15:23:38,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:23:38,637 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:38,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 1 times [2022-04-28 15:23:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [569672995] [2022-04-28 15:23:38,731 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:38,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 2 times [2022-04-28 15:23:38,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:38,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760781632] [2022-04-28 15:23:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:38,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {58704#(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(196, 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); {58697#true} is VALID [2022-04-28 15:23:38,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {58697#true} assume true; {58697#true} is VALID [2022-04-28 15:23:38,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58697#true} {58697#true} #689#return; {58697#true} is VALID [2022-04-28 15:23:38,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {58697#true} call ULTIMATE.init(); {58704#(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 15:23:38,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {58704#(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(196, 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); {58697#true} is VALID [2022-04-28 15:23:38,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {58697#true} assume true; {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58697#true} {58697#true} #689#return; {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {58697#true} call #t~ret161 := main(); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {58697#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {58697#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L272 TraceCheckUtils]: 7: Hoare triple {58697#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {58697#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {58697#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {58697#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {58697#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {58697#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58697#true} is VALID [2022-04-28 15:23:38,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {58697#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {58697#true} assume !false; {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {58697#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {58697#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {58697#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {58697#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {58697#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {58697#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {58697#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {58697#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {58697#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {58697#true} assume 8464 == #t~mem55;havoc #t~mem55; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {58697#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {58697#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {58697#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {58697#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {58697#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {58697#true} ~skip~0 := 0; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {58697#true} assume !false; {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {58697#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {58697#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {58697#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {58697#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {58697#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 37: Hoare triple {58697#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 38: Hoare triple {58697#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 39: Hoare triple {58697#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {58697#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {58697#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {58697#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {58697#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {58697#true} assume 8496 == #t~mem58;havoc #t~mem58; {58697#true} is VALID [2022-04-28 15:23:38,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {58697#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58697#true} is VALID [2022-04-28 15:23:38,866 INFO L290 TraceCheckUtils]: 46: Hoare triple {58697#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58697#true} is VALID [2022-04-28 15:23:38,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {58697#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58697#true} is VALID [2022-04-28 15:23:38,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {58697#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {58702#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58703#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {58703#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {58698#false} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {58698#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {58698#false} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {58698#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {58698#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {58698#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58698#false} is VALID [2022-04-28 15:23:38,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {58698#false} ~skip~0 := 0; {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {58698#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 68: Hoare triple {58698#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 69: Hoare triple {58698#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 70: Hoare triple {58698#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 71: Hoare triple {58698#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 72: Hoare triple {58698#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 73: Hoare triple {58698#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 74: Hoare triple {58698#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,873 INFO L290 TraceCheckUtils]: 75: Hoare triple {58698#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 76: Hoare triple {58698#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {58698#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {58698#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {58698#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 80: Hoare triple {58698#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 81: Hoare triple {58698#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {58698#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {58698#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {58698#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {58698#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {58698#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 87: Hoare triple {58698#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 88: Hoare triple {58698#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 89: Hoare triple {58698#false} assume 8448 == #t~mem68;havoc #t~mem68; {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 90: Hoare triple {58698#false} assume !(~num1~0 > 0); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 91: Hoare triple {58698#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 92: Hoare triple {58698#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 93: Hoare triple {58698#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 94: Hoare triple {58698#false} ~skip~0 := 0; {58698#false} is VALID [2022-04-28 15:23:38,875 INFO L290 TraceCheckUtils]: 95: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 96: Hoare triple {58698#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {58698#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {58698#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {58698#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {58698#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 101: Hoare triple {58698#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 102: Hoare triple {58698#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 103: Hoare triple {58698#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 104: Hoare triple {58698#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 105: Hoare triple {58698#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,876 INFO L290 TraceCheckUtils]: 106: Hoare triple {58698#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 107: Hoare triple {58698#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 108: Hoare triple {58698#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 109: Hoare triple {58698#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 110: Hoare triple {58698#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 111: Hoare triple {58698#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 112: Hoare triple {58698#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 113: Hoare triple {58698#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 114: Hoare triple {58698#false} assume 8544 == #t~mem64;havoc #t~mem64; {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 115: Hoare triple {58698#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {58698#false} is VALID [2022-04-28 15:23:38,877 INFO L290 TraceCheckUtils]: 116: Hoare triple {58698#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 117: Hoare triple {58698#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 118: Hoare triple {58698#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 119: Hoare triple {58698#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 120: Hoare triple {58698#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 121: Hoare triple {58698#false} assume 8 == ~blastFlag~0; {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L290 TraceCheckUtils]: 122: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 15:23:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760781632] [2022-04-28 15:23:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760781632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:38,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:38,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:38,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [569672995] [2022-04-28 15:23:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [569672995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:38,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:38,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231967289] [2022-04-28 15:23:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:38,880 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 123 [2022-04-28 15:23:38,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:38,880 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 15:23:38,957 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 15:23:38,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:38,958 INFO L87 Difference]: Start difference. First operand 426 states and 638 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 15:23:42,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:46,007 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 15:23:48,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:49,170 INFO L93 Difference]: Finished difference Result 890 states and 1337 transitions. [2022-04-28 15:23:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:49,170 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 123 [2022-04-28 15:23:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:49,171 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 15:23:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:23:49,173 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 15:23:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:23:49,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:23:49,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:49,578 INFO L225 Difference]: With dead ends: 890 [2022-04-28 15:23:49,578 INFO L226 Difference]: Without dead ends: 490 [2022-04-28 15:23:49,579 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 15:23:49,579 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 127 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:49,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 456 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 15:23:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-04-28 15:23:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 426. [2022-04-28 15:23:49,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:49,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 490 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 15:23:49,612 INFO L74 IsIncluded]: Start isIncluded. First operand 490 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 15:23:49,612 INFO L87 Difference]: Start difference. First operand 490 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 15:23:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:49,623 INFO L93 Difference]: Finished difference Result 490 states and 722 transitions. [2022-04-28 15:23:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 722 transitions. [2022-04-28 15:23:49,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:49,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:49,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 490 states. [2022-04-28 15:23:49,625 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 490 states. [2022-04-28 15:23:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:49,633 INFO L93 Difference]: Finished difference Result 490 states and 722 transitions. [2022-04-28 15:23:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 722 transitions. [2022-04-28 15:23:49,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:49,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:49,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:49,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 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 15:23:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 631 transitions. [2022-04-28 15:23:49,643 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 631 transitions. Word has length 123 [2022-04-28 15:23:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:49,643 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 631 transitions. [2022-04-28 15:23:49,643 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 15:23:49,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 631 transitions. [2022-04-28 15:23:50,207 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 15:23:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 631 transitions. [2022-04-28 15:23:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 15:23:50,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:50,208 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:23:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:23:50,209 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:50,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1085696608, now seen corresponding path program 1 times [2022-04-28 15:23:50,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:50,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574104092] [2022-04-28 15:23:50,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:50,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1085696608, now seen corresponding path program 2 times [2022-04-28 15:23:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:50,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155202618] [2022-04-28 15:23:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:50,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {62328#(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(196, 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); {62321#true} is VALID [2022-04-28 15:23:50,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {62321#true} assume true; {62321#true} is VALID [2022-04-28 15:23:50,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62321#true} {62321#true} #689#return; {62321#true} is VALID [2022-04-28 15:23:50,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {62321#true} call ULTIMATE.init(); {62328#(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 15:23:50,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {62328#(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(196, 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); {62321#true} is VALID [2022-04-28 15:23:50,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {62321#true} assume true; {62321#true} is VALID [2022-04-28 15:23:50,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62321#true} {62321#true} #689#return; {62321#true} is VALID [2022-04-28 15:23:50,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {62321#true} call #t~ret161 := main(); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {62321#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {62321#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L272 TraceCheckUtils]: 7: Hoare triple {62321#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {62321#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {62321#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {62321#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {62321#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {62321#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {62321#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62321#true} is VALID [2022-04-28 15:23:50,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {62321#true} assume !false; {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {62321#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {62321#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {62321#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {62321#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {62321#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {62321#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {62321#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {62321#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {62321#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {62321#true} assume 8464 == #t~mem55;havoc #t~mem55; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {62321#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {62321#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {62321#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {62321#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {62321#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {62321#true} ~skip~0 := 0; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {62321#true} assume !false; {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {62321#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {62321#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {62321#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {62321#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {62321#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {62321#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {62321#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {62321#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {62321#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {62321#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {62321#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {62321#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {62321#true} assume 8496 == #t~mem58;havoc #t~mem58; {62321#true} is VALID [2022-04-28 15:23:50,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {62321#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62321#true} is VALID [2022-04-28 15:23:50,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {62321#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62321#true} is VALID [2022-04-28 15:23:50,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {62321#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62321#true} is VALID [2022-04-28 15:23:50,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {62321#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,436 INFO L290 TraceCheckUtils]: 50: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,436 INFO L290 TraceCheckUtils]: 51: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,436 INFO L290 TraceCheckUtils]: 52: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,438 INFO L290 TraceCheckUtils]: 55: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,438 INFO L290 TraceCheckUtils]: 56: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,438 INFO L290 TraceCheckUtils]: 57: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,442 INFO L290 TraceCheckUtils]: 65: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,442 INFO L290 TraceCheckUtils]: 66: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,442 INFO L290 TraceCheckUtils]: 67: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,444 INFO L290 TraceCheckUtils]: 70: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,444 INFO L290 TraceCheckUtils]: 71: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,444 INFO L290 TraceCheckUtils]: 72: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,445 INFO L290 TraceCheckUtils]: 73: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,445 INFO L290 TraceCheckUtils]: 74: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,447 INFO L290 TraceCheckUtils]: 77: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,447 INFO L290 TraceCheckUtils]: 78: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,447 INFO L290 TraceCheckUtils]: 79: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,448 INFO L290 TraceCheckUtils]: 80: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,448 INFO L290 TraceCheckUtils]: 81: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,449 INFO L290 TraceCheckUtils]: 82: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,449 INFO L290 TraceCheckUtils]: 83: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:23:50,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {62326#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {62327#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 15:23:50,450 INFO L290 TraceCheckUtils]: 87: Hoare triple {62327#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {62322#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {62322#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 90: Hoare triple {62322#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {62322#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {62322#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 93: Hoare triple {62322#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 94: Hoare triple {62322#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62322#false} is VALID [2022-04-28 15:23:50,451 INFO L290 TraceCheckUtils]: 95: Hoare triple {62322#false} ~skip~0 := 0; {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {62322#false} assume !false; {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 97: Hoare triple {62322#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 98: Hoare triple {62322#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 99: Hoare triple {62322#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 100: Hoare triple {62322#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 101: Hoare triple {62322#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 102: Hoare triple {62322#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 103: Hoare triple {62322#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 104: Hoare triple {62322#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,452 INFO L290 TraceCheckUtils]: 105: Hoare triple {62322#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 106: Hoare triple {62322#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 107: Hoare triple {62322#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 108: Hoare triple {62322#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 109: Hoare triple {62322#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 110: Hoare triple {62322#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 111: Hoare triple {62322#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 112: Hoare triple {62322#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 113: Hoare triple {62322#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 114: Hoare triple {62322#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 115: Hoare triple {62322#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,453 INFO L290 TraceCheckUtils]: 116: Hoare triple {62322#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 117: Hoare triple {62322#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 118: Hoare triple {62322#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 119: Hoare triple {62322#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 120: Hoare triple {62322#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 121: Hoare triple {62322#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 122: Hoare triple {62322#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 123: Hoare triple {62322#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 124: Hoare triple {62322#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 125: Hoare triple {62322#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62322#false} is VALID [2022-04-28 15:23:50,454 INFO L290 TraceCheckUtils]: 126: Hoare triple {62322#false} assume 8640 == #t~mem75;havoc #t~mem75; {62322#false} is VALID [2022-04-28 15:23:50,455 INFO L290 TraceCheckUtils]: 127: Hoare triple {62322#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62322#false} is VALID [2022-04-28 15:23:50,455 INFO L290 TraceCheckUtils]: 128: Hoare triple {62322#false} assume 4 == ~blastFlag~0; {62322#false} is VALID [2022-04-28 15:23:50,455 INFO L290 TraceCheckUtils]: 129: Hoare triple {62322#false} assume !false; {62322#false} is VALID [2022-04-28 15:23:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:23:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155202618] [2022-04-28 15:23:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155202618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:50,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574104092] [2022-04-28 15:23:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574104092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165265870] [2022-04-28 15:23:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 130 [2022-04-28 15:23:50,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:50,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 15:23:50,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:23:50,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:50,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:50,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:50,542 INFO L87 Difference]: Start difference. First operand 426 states and 631 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 15:23:54,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:58,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:01,700 INFO L93 Difference]: Finished difference Result 932 states and 1384 transitions. [2022-04-28 15:24:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 130 [2022-04-28 15:24:01,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 15:24:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:24:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 15:24:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:24:01,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:24:02,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:02,094 INFO L225 Difference]: With dead ends: 932 [2022-04-28 15:24:02,095 INFO L226 Difference]: Without dead ends: 532 [2022-04-28 15:24:02,095 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 15:24:02,096 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:02,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 15:24:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-28 15:24:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 469. [2022-04-28 15:24:02,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:02,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 532 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:02,134 INFO L74 IsIncluded]: Start isIncluded. First operand 532 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:02,134 INFO L87 Difference]: Start difference. First operand 532 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:02,143 INFO L93 Difference]: Finished difference Result 532 states and 782 transitions. [2022-04-28 15:24:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 782 transitions. [2022-04-28 15:24:02,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:02,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:02,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 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 532 states. [2022-04-28 15:24:02,144 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 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 532 states. [2022-04-28 15:24:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:02,155 INFO L93 Difference]: Finished difference Result 532 states and 782 transitions. [2022-04-28 15:24:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 782 transitions. [2022-04-28 15:24:02,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:02,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:02,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:02,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 695 transitions. [2022-04-28 15:24:02,168 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 695 transitions. Word has length 130 [2022-04-28 15:24:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:02,169 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 695 transitions. [2022-04-28 15:24:02,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 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 15:24:02,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 695 transitions. [2022-04-28 15:24:02,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 695 transitions. [2022-04-28 15:24:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:24:02,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:02,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-28 15:24:02,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:24:02,803 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:02,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:02,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 1 times [2022-04-28 15:24:02,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:02,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939034658] [2022-04-28 15:24:02,888 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:02,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 2 times [2022-04-28 15:24:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:02,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792507102] [2022-04-28 15:24:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:03,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {66206#(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(196, 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); {66199#true} is VALID [2022-04-28 15:24:03,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {66199#true} assume true; {66199#true} is VALID [2022-04-28 15:24:03,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66199#true} {66199#true} #689#return; {66199#true} is VALID [2022-04-28 15:24:03,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {66199#true} call ULTIMATE.init(); {66206#(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 15:24:03,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {66206#(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(196, 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); {66199#true} is VALID [2022-04-28 15:24:03,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {66199#true} assume true; {66199#true} is VALID [2022-04-28 15:24:03,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66199#true} {66199#true} #689#return; {66199#true} is VALID [2022-04-28 15:24:03,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {66199#true} call #t~ret161 := main(); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {66199#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {66199#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L272 TraceCheckUtils]: 7: Hoare triple {66199#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {66199#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {66199#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {66199#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {66199#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {66199#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {66199#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66199#true} is VALID [2022-04-28 15:24:03,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {66199#true} assume !false; {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {66199#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {66199#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {66199#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {66199#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {66199#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {66199#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {66199#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {66199#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {66199#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {66199#true} assume 8464 == #t~mem55;havoc #t~mem55; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {66199#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {66199#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {66199#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {66199#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {66199#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {66199#true} ~skip~0 := 0; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {66199#true} assume !false; {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {66199#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {66199#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {66199#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {66199#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {66199#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {66199#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {66199#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {66199#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {66199#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {66199#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {66199#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {66199#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {66199#true} assume 8496 == #t~mem58;havoc #t~mem58; {66199#true} is VALID [2022-04-28 15:24:03,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {66199#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66199#true} is VALID [2022-04-28 15:24:03,049 INFO L290 TraceCheckUtils]: 46: Hoare triple {66199#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66199#true} is VALID [2022-04-28 15:24:03,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {66199#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66199#true} is VALID [2022-04-28 15:24:03,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {66199#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,051 INFO L290 TraceCheckUtils]: 52: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:03,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66205#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-28 15:24:03,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {66205#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {66200#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {66200#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 71: Hoare triple {66200#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 72: Hoare triple {66200#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 73: Hoare triple {66200#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66200#false} is VALID [2022-04-28 15:24:03,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {66200#false} ~skip~0 := 0; {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 75: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 76: Hoare triple {66200#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {66200#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 78: Hoare triple {66200#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {66200#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {66200#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 81: Hoare triple {66200#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 82: Hoare triple {66200#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 83: Hoare triple {66200#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,060 INFO L290 TraceCheckUtils]: 84: Hoare triple {66200#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 85: Hoare triple {66200#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 86: Hoare triple {66200#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 87: Hoare triple {66200#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {66200#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {66200#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {66200#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 91: Hoare triple {66200#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 92: Hoare triple {66200#false} assume 8528 == #t~mem62;havoc #t~mem62; {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 93: Hoare triple {66200#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 94: Hoare triple {66200#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {66200#false} is VALID [2022-04-28 15:24:03,061 INFO L290 TraceCheckUtils]: 95: Hoare triple {66200#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 96: Hoare triple {66200#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 97: Hoare triple {66200#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 98: Hoare triple {66200#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 99: Hoare triple {66200#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 100: Hoare triple {66200#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 101: Hoare triple {66200#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 102: Hoare triple {66200#false} ~skip~0 := 0; {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 103: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 104: Hoare triple {66200#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,062 INFO L290 TraceCheckUtils]: 105: Hoare triple {66200#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 106: Hoare triple {66200#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 107: Hoare triple {66200#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {66200#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {66200#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 110: Hoare triple {66200#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 111: Hoare triple {66200#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 112: Hoare triple {66200#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 113: Hoare triple {66200#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 114: Hoare triple {66200#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,063 INFO L290 TraceCheckUtils]: 115: Hoare triple {66200#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 116: Hoare triple {66200#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 117: Hoare triple {66200#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 118: Hoare triple {66200#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 119: Hoare triple {66200#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 120: Hoare triple {66200#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 121: Hoare triple {66200#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 122: Hoare triple {66200#false} assume 8544 == #t~mem64;havoc #t~mem64; {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 123: Hoare triple {66200#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 124: Hoare triple {66200#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {66200#false} is VALID [2022-04-28 15:24:03,064 INFO L290 TraceCheckUtils]: 125: Hoare triple {66200#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L290 TraceCheckUtils]: 126: Hoare triple {66200#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L290 TraceCheckUtils]: 127: Hoare triple {66200#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L290 TraceCheckUtils]: 128: Hoare triple {66200#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L290 TraceCheckUtils]: 129: Hoare triple {66200#false} assume 8 == ~blastFlag~0; {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L290 TraceCheckUtils]: 130: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:24:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 15:24:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:03,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792507102] [2022-04-28 15:24:03,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792507102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:03,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:03,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:03,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:03,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939034658] [2022-04-28 15:24:03,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939034658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:03,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:03,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680834647] [2022-04-28 15:24:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:03,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:03,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 15:24:03,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:03,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:24:03,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:24:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:24:03,142 INFO L87 Difference]: Start difference. First operand 469 states and 695 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 15:24:12,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:13,456 INFO L93 Difference]: Finished difference Result 983 states and 1459 transitions. [2022-04-28 15:24:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 15:24:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:24:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 15:24:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:24:13,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-04-28 15:24:13,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:13,794 INFO L225 Difference]: With dead ends: 983 [2022-04-28 15:24:13,794 INFO L226 Difference]: Without dead ends: 540 [2022-04-28 15:24:13,795 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 15:24:13,795 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 65 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:13,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 527 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:24:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-04-28 15:24:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 495. [2022-04-28 15:24:13,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:13,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:13,836 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:13,836 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:13,849 INFO L93 Difference]: Finished difference Result 540 states and 793 transitions. [2022-04-28 15:24:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2022-04-28 15:24:13,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:13,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:13,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 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 540 states. [2022-04-28 15:24:13,851 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 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 540 states. [2022-04-28 15:24:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:13,860 INFO L93 Difference]: Finished difference Result 540 states and 793 transitions. [2022-04-28 15:24:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2022-04-28 15:24:13,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:13,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:13,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:13,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 732 transitions. [2022-04-28 15:24:13,871 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 732 transitions. Word has length 131 [2022-04-28 15:24:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:13,872 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 732 transitions. [2022-04-28 15:24:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 15:24:13,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 732 transitions. [2022-04-28 15:24:14,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 732 edges. 732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 732 transitions. [2022-04-28 15:24:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:24:14,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:14,541 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:24:14,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:24:14,541 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash -22008148, now seen corresponding path program 1 times [2022-04-28 15:24:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987783675] [2022-04-28 15:24:14,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:14,624 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash -22008148, now seen corresponding path program 2 times [2022-04-28 15:24:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:14,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217782295] [2022-04-28 15:24:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:14,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {70254#(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(196, 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); {70247#true} is VALID [2022-04-28 15:24:14,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {70247#true} assume true; {70247#true} is VALID [2022-04-28 15:24:14,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70247#true} {70247#true} #689#return; {70247#true} is VALID [2022-04-28 15:24:14,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {70247#true} call ULTIMATE.init(); {70254#(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 15:24:14,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {70254#(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(196, 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); {70247#true} is VALID [2022-04-28 15:24:14,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {70247#true} assume true; {70247#true} is VALID [2022-04-28 15:24:14,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70247#true} {70247#true} #689#return; {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {70247#true} call #t~ret161 := main(); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {70247#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {70247#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L272 TraceCheckUtils]: 7: Hoare triple {70247#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {70247#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {70247#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {70247#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {70247#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {70247#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70247#true} is VALID [2022-04-28 15:24:14,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {70247#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {70247#true} assume !false; {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {70247#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {70247#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {70247#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {70247#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {70247#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {70247#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {70247#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {70247#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {70247#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {70247#true} assume 8464 == #t~mem55;havoc #t~mem55; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {70247#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {70247#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {70247#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {70247#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {70247#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {70247#true} ~skip~0 := 0; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {70247#true} assume !false; {70247#true} is VALID [2022-04-28 15:24:14,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {70247#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {70247#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {70247#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {70247#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {70247#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {70247#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {70247#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {70247#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {70247#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {70247#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {70247#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {70247#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {70247#true} assume 8496 == #t~mem58;havoc #t~mem58; {70247#true} is VALID [2022-04-28 15:24:14,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {70247#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70247#true} is VALID [2022-04-28 15:24:14,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {70247#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70247#true} is VALID [2022-04-28 15:24:14,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {70247#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70247#true} is VALID [2022-04-28 15:24:14,758 INFO L290 TraceCheckUtils]: 48: Hoare triple {70247#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,759 INFO L290 TraceCheckUtils]: 50: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,759 INFO L290 TraceCheckUtils]: 51: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,762 INFO L290 TraceCheckUtils]: 58: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,763 INFO L290 TraceCheckUtils]: 59: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,765 INFO L290 TraceCheckUtils]: 66: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,766 INFO L290 TraceCheckUtils]: 67: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,766 INFO L290 TraceCheckUtils]: 68: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,767 INFO L290 TraceCheckUtils]: 71: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,769 INFO L290 TraceCheckUtils]: 74: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,769 INFO L290 TraceCheckUtils]: 75: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,770 INFO L290 TraceCheckUtils]: 77: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,771 INFO L290 TraceCheckUtils]: 79: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,771 INFO L290 TraceCheckUtils]: 80: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,772 INFO L290 TraceCheckUtils]: 83: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 84: Hoare triple {70252#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {70253#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 85: Hoare triple {70253#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 86: Hoare triple {70248#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 87: Hoare triple {70248#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 88: Hoare triple {70248#false} assume 8673 == #t~mem80;havoc #t~mem80; {70248#false} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {70248#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {70248#false} is VALID [2022-04-28 15:24:14,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {70248#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 91: Hoare triple {70248#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 92: Hoare triple {70248#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 93: Hoare triple {70248#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 94: Hoare triple {70248#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 95: Hoare triple {70248#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 96: Hoare triple {70248#false} ~skip~0 := 0; {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 97: Hoare triple {70248#false} assume !false; {70248#false} is VALID [2022-04-28 15:24:14,774 INFO L290 TraceCheckUtils]: 98: Hoare triple {70248#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 99: Hoare triple {70248#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 100: Hoare triple {70248#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 101: Hoare triple {70248#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 102: Hoare triple {70248#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 103: Hoare triple {70248#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 104: Hoare triple {70248#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 105: Hoare triple {70248#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {70248#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {70248#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,775 INFO L290 TraceCheckUtils]: 108: Hoare triple {70248#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 109: Hoare triple {70248#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 110: Hoare triple {70248#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 111: Hoare triple {70248#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 112: Hoare triple {70248#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 113: Hoare triple {70248#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 114: Hoare triple {70248#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 115: Hoare triple {70248#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 116: Hoare triple {70248#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 117: Hoare triple {70248#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,776 INFO L290 TraceCheckUtils]: 118: Hoare triple {70248#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 119: Hoare triple {70248#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 120: Hoare triple {70248#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 121: Hoare triple {70248#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 122: Hoare triple {70248#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 123: Hoare triple {70248#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 124: Hoare triple {70248#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 125: Hoare triple {70248#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 126: Hoare triple {70248#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 127: Hoare triple {70248#false} assume 8640 == #t~mem75;havoc #t~mem75; {70248#false} is VALID [2022-04-28 15:24:14,777 INFO L290 TraceCheckUtils]: 128: Hoare triple {70248#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {70248#false} is VALID [2022-04-28 15:24:14,778 INFO L290 TraceCheckUtils]: 129: Hoare triple {70248#false} assume 4 == ~blastFlag~0; {70248#false} is VALID [2022-04-28 15:24:14,778 INFO L290 TraceCheckUtils]: 130: Hoare triple {70248#false} assume !false; {70248#false} is VALID [2022-04-28 15:24:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:24:14,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:14,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217782295] [2022-04-28 15:24:14,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217782295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:14,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:14,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:14,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:14,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987783675] [2022-04-28 15:24:14,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987783675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:14,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:14,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:24:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732655239] [2022-04-28 15:24:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:14,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:14,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:14,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 15:24:14,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:14,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:24:14,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:24:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:24:14,876 INFO L87 Difference]: Start difference. First operand 495 states and 732 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 15:24:16,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:19,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:25,507 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2022-04-28 15:24:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:24:25,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 15:24:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:24:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 15:24:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:24:25,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 15:24:25,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:25,849 INFO L225 Difference]: With dead ends: 1003 [2022-04-28 15:24:25,849 INFO L226 Difference]: Without dead ends: 534 [2022-04-28 15:24:25,850 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 15:24:25,851 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:25,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 533 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 15:24:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-04-28 15:24:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2022-04-28 15:24:25,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:25,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:25,881 INFO L74 IsIncluded]: Start isIncluded. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:25,882 INFO L87 Difference]: Start difference. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:25,895 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:24:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:24:25,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:25,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:25,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 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 534 states. [2022-04-28 15:24:25,897 INFO L87 Difference]: Start difference. First operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 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 534 states. [2022-04-28 15:24:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:25,910 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:24:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:24:25,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:25,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:25,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:25,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 756 transitions. [2022-04-28 15:24:25,924 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 756 transitions. Word has length 131 [2022-04-28 15:24:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:25,924 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 756 transitions. [2022-04-28 15:24:25,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 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 15:24:25,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 512 states and 756 transitions. [2022-04-28 15:24:26,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 756 transitions. [2022-04-28 15:24:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:24:26,645 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:26,646 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-28 15:24:26,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:24:26,646 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 1 times [2022-04-28 15:24:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888210363] [2022-04-28 15:24:26,741 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:26,741 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 2 times [2022-04-28 15:24:26,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:26,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665769817] [2022-04-28 15:24:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:26,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {74363#(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(196, 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); {74357#true} is VALID [2022-04-28 15:24:26,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {74357#true} assume true; {74357#true} is VALID [2022-04-28 15:24:26,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74357#true} {74357#true} #689#return; {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {74357#true} call ULTIMATE.init(); {74363#(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 15:24:26,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {74363#(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(196, 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); {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {74357#true} assume true; {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74357#true} {74357#true} #689#return; {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {74357#true} call #t~ret161 := main(); {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {74357#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {74357#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L272 TraceCheckUtils]: 7: Hoare triple {74357#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74357#true} is VALID [2022-04-28 15:24:26,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {74357#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {74357#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {74357#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {74357#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {74357#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {74357#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {74357#true} assume !false; {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {74357#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {74357#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {74357#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {74357#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {74357#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {74357#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {74357#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {74357#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {74357#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {74357#true} assume 8464 == #t~mem55;havoc #t~mem55; {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {74357#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {74357#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {74357#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {74357#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {74357#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {74357#true} ~skip~0 := 0; {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {74357#true} assume !false; {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {74357#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {74357#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {74357#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {74357#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {74357#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {74357#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {74357#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {74357#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {74357#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {74357#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {74357#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {74357#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {74357#true} assume 8496 == #t~mem58;havoc #t~mem58; {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {74357#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74357#true} is VALID [2022-04-28 15:24:26,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {74357#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,894 INFO L290 TraceCheckUtils]: 64: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,895 INFO L290 TraceCheckUtils]: 66: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,895 INFO L290 TraceCheckUtils]: 67: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,897 INFO L290 TraceCheckUtils]: 71: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,897 INFO L290 TraceCheckUtils]: 72: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,897 INFO L290 TraceCheckUtils]: 73: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,898 INFO L290 TraceCheckUtils]: 74: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,899 INFO L290 TraceCheckUtils]: 77: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,899 INFO L290 TraceCheckUtils]: 78: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,899 INFO L290 TraceCheckUtils]: 79: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,900 INFO L290 TraceCheckUtils]: 80: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,900 INFO L290 TraceCheckUtils]: 81: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,900 INFO L290 TraceCheckUtils]: 82: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,901 INFO L290 TraceCheckUtils]: 83: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,901 INFO L290 TraceCheckUtils]: 84: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,901 INFO L290 TraceCheckUtils]: 85: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,902 INFO L290 TraceCheckUtils]: 86: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,902 INFO L290 TraceCheckUtils]: 87: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,902 INFO L290 TraceCheckUtils]: 88: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,903 INFO L290 TraceCheckUtils]: 89: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,904 INFO L290 TraceCheckUtils]: 92: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,904 INFO L290 TraceCheckUtils]: 93: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,904 INFO L290 TraceCheckUtils]: 94: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,905 INFO L290 TraceCheckUtils]: 95: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,905 INFO L290 TraceCheckUtils]: 96: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,905 INFO L290 TraceCheckUtils]: 97: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,906 INFO L290 TraceCheckUtils]: 99: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,906 INFO L290 TraceCheckUtils]: 100: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,907 INFO L290 TraceCheckUtils]: 101: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,907 INFO L290 TraceCheckUtils]: 102: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,907 INFO L290 TraceCheckUtils]: 103: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,908 INFO L290 TraceCheckUtils]: 104: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,908 INFO L290 TraceCheckUtils]: 105: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,908 INFO L290 TraceCheckUtils]: 106: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,908 INFO L290 TraceCheckUtils]: 107: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,909 INFO L290 TraceCheckUtils]: 108: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,909 INFO L290 TraceCheckUtils]: 109: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,909 INFO L290 TraceCheckUtils]: 110: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,910 INFO L290 TraceCheckUtils]: 111: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,911 INFO L290 TraceCheckUtils]: 114: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,911 INFO L290 TraceCheckUtils]: 115: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,911 INFO L290 TraceCheckUtils]: 116: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,912 INFO L290 TraceCheckUtils]: 117: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,912 INFO L290 TraceCheckUtils]: 118: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,912 INFO L290 TraceCheckUtils]: 119: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,913 INFO L290 TraceCheckUtils]: 120: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,913 INFO L290 TraceCheckUtils]: 121: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,913 INFO L290 TraceCheckUtils]: 122: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,914 INFO L290 TraceCheckUtils]: 123: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,914 INFO L290 TraceCheckUtils]: 124: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,914 INFO L290 TraceCheckUtils]: 125: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,915 INFO L290 TraceCheckUtils]: 126: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,915 INFO L290 TraceCheckUtils]: 127: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,915 INFO L290 TraceCheckUtils]: 128: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {74362#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:24:26,916 INFO L290 TraceCheckUtils]: 129: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {74358#false} is VALID [2022-04-28 15:24:26,916 INFO L290 TraceCheckUtils]: 130: Hoare triple {74358#false} assume !false; {74358#false} is VALID [2022-04-28 15:24:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 15:24:26,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665769817] [2022-04-28 15:24:26,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665769817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:26,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:26,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:26,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:26,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888210363] [2022-04-28 15:24:26,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888210363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:26,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:26,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668293581] [2022-04-28 15:24:26,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:26,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 131 [2022-04-28 15:24:26,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:26,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 15:24:26,994 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 15:24:26,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:26,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:26,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:26,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:26,995 INFO L87 Difference]: Start difference. First operand 512 states and 756 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 15:24:31,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:33,879 INFO L93 Difference]: Finished difference Result 1437 states and 2141 transitions. [2022-04-28 15:24:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 131 [2022-04-28 15:24:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 15:24:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-28 15:24:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 15:24:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-28 15:24:33,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 599 transitions. [2022-04-28 15:24:34,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:34,308 INFO L225 Difference]: With dead ends: 1437 [2022-04-28 15:24:34,308 INFO L226 Difference]: Without dead ends: 951 [2022-04-28 15:24:34,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:34,309 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:34,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 434 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 15:24:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-04-28 15:24:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-04-28 15:24:34,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:34,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 951 states. Second operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:34,390 INFO L74 IsIncluded]: Start isIncluded. First operand 951 states. Second operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:34,391 INFO L87 Difference]: Start difference. First operand 951 states. Second operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:34,430 INFO L93 Difference]: Finished difference Result 951 states and 1407 transitions. [2022-04-28 15:24:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:24:34,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:34,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:34,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 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 951 states. [2022-04-28 15:24:34,434 INFO L87 Difference]: Start difference. First operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 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 951 states. [2022-04-28 15:24:34,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:34,468 INFO L93 Difference]: Finished difference Result 951 states and 1407 transitions. [2022-04-28 15:24:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:24:34,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:34,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:34,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:34,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 946 states have (on average 1.4830866807610994) internal successors, (1403), 946 states have internal predecessors, (1403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1407 transitions. [2022-04-28 15:24:34,518 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1407 transitions. Word has length 131 [2022-04-28 15:24:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:34,518 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1407 transitions. [2022-04-28 15:24:34,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 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 15:24:34,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 951 states and 1407 transitions. [2022-04-28 15:24:35,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1407 edges. 1407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:24:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:24:35,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:35,819 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-28 15:24:35,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:24:35,819 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 1 times [2022-04-28 15:24:35,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:35,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877272299] [2022-04-28 15:24:35,917 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:35,917 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 2 times [2022-04-28 15:24:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:35,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235625255] [2022-04-28 15:24:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:36,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {81050#(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(196, 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); {81044#true} is VALID [2022-04-28 15:24:36,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {81044#true} assume true; {81044#true} is VALID [2022-04-28 15:24:36,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81044#true} {81044#true} #689#return; {81044#true} is VALID [2022-04-28 15:24:36,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {81044#true} call ULTIMATE.init(); {81050#(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 15:24:36,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {81050#(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(196, 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); {81044#true} is VALID [2022-04-28 15:24:36,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {81044#true} assume true; {81044#true} is VALID [2022-04-28 15:24:36,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81044#true} {81044#true} #689#return; {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {81044#true} call #t~ret161 := main(); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {81044#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {81044#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L272 TraceCheckUtils]: 7: Hoare triple {81044#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {81044#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {81044#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {81044#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {81044#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {81044#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {81044#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81044#true} is VALID [2022-04-28 15:24:36,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {81044#true} assume !false; {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {81044#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {81044#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {81044#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {81044#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {81044#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {81044#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {81044#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {81044#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {81044#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {81044#true} assume 8464 == #t~mem55;havoc #t~mem55; {81044#true} is VALID [2022-04-28 15:24:36,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {81044#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81044#true} is VALID [2022-04-28 15:24:36,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {81044#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81049#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81045#false} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {81045#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {81045#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {81045#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {81045#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {81045#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {81045#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {81045#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {81045#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {81045#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {81045#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 59: Hoare triple {81045#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 60: Hoare triple {81045#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {81045#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {81045#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {81045#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {81045#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {81045#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {81045#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {81045#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {81045#false} assume 8512 == #t~mem60;havoc #t~mem60; {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {81045#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {81045#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {81045#false} is VALID [2022-04-28 15:24:36,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {81045#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {81045#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {81045#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {81045#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {81045#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {81045#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {81045#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {81045#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 81: Hoare triple {81045#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,044 INFO L290 TraceCheckUtils]: 82: Hoare triple {81045#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 83: Hoare triple {81045#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {81045#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {81045#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {81045#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {81045#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {81045#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {81045#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {81045#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {81045#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {81045#false} assume 8528 == #t~mem62;havoc #t~mem62; {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {81045#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {81045#false} is VALID [2022-04-28 15:24:36,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {81045#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 95: Hoare triple {81045#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {81045#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {81045#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {81045#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {81045#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {81045#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {81045#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {81045#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {81045#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {81045#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {81045#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {81045#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 109: Hoare triple {81045#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {81045#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {81045#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 112: Hoare triple {81045#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 113: Hoare triple {81045#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 114: Hoare triple {81045#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,047 INFO L290 TraceCheckUtils]: 115: Hoare triple {81045#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {81045#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {81045#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {81045#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {81045#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {81045#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 121: Hoare triple {81045#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 122: Hoare triple {81045#false} assume 8544 == #t~mem64;havoc #t~mem64; {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {81045#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {81045#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {81045#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81045#false} is VALID [2022-04-28 15:24:36,048 INFO L290 TraceCheckUtils]: 126: Hoare triple {81045#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {81045#false} is VALID [2022-04-28 15:24:36,049 INFO L290 TraceCheckUtils]: 127: Hoare triple {81045#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {81045#false} is VALID [2022-04-28 15:24:36,049 INFO L290 TraceCheckUtils]: 128: Hoare triple {81045#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {81045#false} is VALID [2022-04-28 15:24:36,049 INFO L290 TraceCheckUtils]: 129: Hoare triple {81045#false} assume 8 == ~blastFlag~0; {81045#false} is VALID [2022-04-28 15:24:36,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:24:36,049 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-28 15:24:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:36,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235625255] [2022-04-28 15:24:36,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235625255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:36,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877272299] [2022-04-28 15:24:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877272299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073493879] [2022-04-28 15:24:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:36,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:36,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 15:24:36,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:36,127 INFO L87 Difference]: Start difference. First operand 951 states and 1407 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 15:24:39,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:45,040 INFO L93 Difference]: Finished difference Result 1903 states and 2821 transitions. [2022-04-28 15:24:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 15:24:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:24:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 15:24:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:24:45,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-28 15:24:45,322 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 15:24:45,363 INFO L225 Difference]: With dead ends: 1903 [2022-04-28 15:24:45,364 INFO L226 Difference]: Without dead ends: 978 [2022-04-28 15:24:45,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:45,365 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:45,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 15:24:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-04-28 15:24:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2022-04-28 15:24:45,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:45,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 978 states. Second operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:45,440 INFO L74 IsIncluded]: Start isIncluded. First operand 978 states. Second operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:45,440 INFO L87 Difference]: Start difference. First operand 978 states. Second operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:45,466 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2022-04-28 15:24:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:24:45,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:45,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:45,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 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 978 states. [2022-04-28 15:24:45,468 INFO L87 Difference]: Start difference. First operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 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 978 states. [2022-04-28 15:24:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:45,493 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2022-04-28 15:24:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:24:45,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:45,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:45,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:45,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 973 states have (on average 1.4779033915724564) internal successors, (1438), 973 states have internal predecessors, (1438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1442 transitions. [2022-04-28 15:24:45,531 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1442 transitions. Word has length 131 [2022-04-28 15:24:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:45,531 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 1442 transitions. [2022-04-28 15:24:45,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 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 15:24:45,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 978 states and 1442 transitions. [2022-04-28 15:24:46,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1442 edges. 1442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:24:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:24:46,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:46,882 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-28 15:24:46,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:24:46,882 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 1 times [2022-04-28 15:24:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:46,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1149018747] [2022-04-28 15:24:46,972 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:46,972 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 2 times [2022-04-28 15:24:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:46,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061475989] [2022-04-28 15:24:46,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:46,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:47,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {88777#(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(196, 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); {88771#true} is VALID [2022-04-28 15:24:47,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {88771#true} assume true; {88771#true} is VALID [2022-04-28 15:24:47,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88771#true} {88771#true} #689#return; {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {88771#true} call ULTIMATE.init(); {88777#(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 15:24:47,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {88777#(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(196, 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); {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {88771#true} assume true; {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88771#true} {88771#true} #689#return; {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {88771#true} call #t~ret161 := main(); {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {88771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88771#true} is VALID [2022-04-28 15:24:47,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {88771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88771#true} is VALID [2022-04-28 15:24:47,087 INFO L272 TraceCheckUtils]: 7: Hoare triple {88771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88771#true} is VALID [2022-04-28 15:24:47,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {88771#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88776#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:24:47,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88772#false} is VALID [2022-04-28 15:24:47,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {88772#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {88772#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {88772#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 32: Hoare triple {88772#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {88772#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {88772#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {88772#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {88772#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {88772#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {88772#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {88772#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {88772#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {88772#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {88772#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {88772#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {88772#false} assume 8496 == #t~mem58;havoc #t~mem58; {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {88772#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {88772#false} assume !(1 == ~blastFlag~0); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {88772#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {88772#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {88772#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {88772#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {88772#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {88772#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {88772#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {88772#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {88772#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {88772#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {88772#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {88772#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {88772#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {88772#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {88772#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {88772#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {88772#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {88772#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {88772#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {88772#false} assume 8512 == #t~mem60;havoc #t~mem60; {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {88772#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {88772#false} is VALID [2022-04-28 15:24:47,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {88772#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {88772#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {88772#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {88772#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 75: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 76: Hoare triple {88772#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 77: Hoare triple {88772#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {88772#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {88772#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {88772#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {88772#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {88772#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {88772#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {88772#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 85: Hoare triple {88772#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 86: Hoare triple {88772#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {88772#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {88772#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 89: Hoare triple {88772#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {88772#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {88772#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {88772#false} assume 8528 == #t~mem62;havoc #t~mem62; {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {88772#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {88772#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {88772#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {88772#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88772#false} is VALID [2022-04-28 15:24:47,099 INFO L290 TraceCheckUtils]: 97: Hoare triple {88772#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 98: Hoare triple {88772#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 99: Hoare triple {88772#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 100: Hoare triple {88772#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {88772#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {88772#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {88772#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {88772#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,100 INFO L290 TraceCheckUtils]: 107: Hoare triple {88772#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 108: Hoare triple {88772#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 109: Hoare triple {88772#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 110: Hoare triple {88772#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 111: Hoare triple {88772#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 112: Hoare triple {88772#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 113: Hoare triple {88772#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 114: Hoare triple {88772#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 115: Hoare triple {88772#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 116: Hoare triple {88772#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,101 INFO L290 TraceCheckUtils]: 117: Hoare triple {88772#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 118: Hoare triple {88772#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 119: Hoare triple {88772#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 120: Hoare triple {88772#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 121: Hoare triple {88772#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 122: Hoare triple {88772#false} assume 8544 == #t~mem64;havoc #t~mem64; {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 123: Hoare triple {88772#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 124: Hoare triple {88772#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 125: Hoare triple {88772#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 126: Hoare triple {88772#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {88772#false} is VALID [2022-04-28 15:24:47,102 INFO L290 TraceCheckUtils]: 127: Hoare triple {88772#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {88772#false} is VALID [2022-04-28 15:24:47,103 INFO L290 TraceCheckUtils]: 128: Hoare triple {88772#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {88772#false} is VALID [2022-04-28 15:24:47,103 INFO L290 TraceCheckUtils]: 129: Hoare triple {88772#false} assume 8 == ~blastFlag~0; {88772#false} is VALID [2022-04-28 15:24:47,103 INFO L290 TraceCheckUtils]: 130: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:24:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 15:24:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:47,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061475989] [2022-04-28 15:24:47,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061475989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:47,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:47,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1149018747] [2022-04-28 15:24:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1149018747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:47,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872380951] [2022-04-28 15:24:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:47,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:47,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 15:24:47,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:47,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:47,170 INFO L87 Difference]: Start difference. First operand 978 states and 1442 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 15:24:51,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:52,075 INFO L93 Difference]: Finished difference Result 1932 states and 2857 transitions. [2022-04-28 15:24:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 131 [2022-04-28 15:24:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 15:24:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:24:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 15:24:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:24:52,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-28 15:24:52,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:52,403 INFO L225 Difference]: With dead ends: 1932 [2022-04-28 15:24:52,403 INFO L226 Difference]: Without dead ends: 980 [2022-04-28 15:24:52,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:52,405 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:52,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 15:24:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-04-28 15:24:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2022-04-28 15:24:52,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:52,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:52,476 INFO L74 IsIncluded]: Start isIncluded. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:52,477 INFO L87 Difference]: Start difference. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:52,503 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:24:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:52,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:52,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 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 980 states. [2022-04-28 15:24:52,505 INFO L87 Difference]: Start difference. First operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 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 980 states. [2022-04-28 15:24:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:52,530 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:24:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:52,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:52,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:52,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:52,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:24:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1444 transitions. [2022-04-28 15:24:52,584 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1444 transitions. Word has length 131 [2022-04-28 15:24:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:52,584 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1444 transitions. [2022-04-28 15:24:52,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 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 15:24:52,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 980 states and 1444 transitions. [2022-04-28 15:24:53,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1444 edges. 1444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:24:53,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:53,945 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:24:53,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:24:53,946 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 1 times [2022-04-28 15:24:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:53,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1400465451] [2022-04-28 15:24:54,051 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:54,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 2 times [2022-04-28 15:24:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:54,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444461472] [2022-04-28 15:24:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:54,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {96570#(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(196, 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); {96564#true} is VALID [2022-04-28 15:24:54,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {96564#true} assume true; {96564#true} is VALID [2022-04-28 15:24:54,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96564#true} {96564#true} #689#return; {96564#true} is VALID [2022-04-28 15:24:54,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {96564#true} call ULTIMATE.init(); {96570#(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 15:24:54,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {96570#(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(196, 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); {96564#true} is VALID [2022-04-28 15:24:54,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {96564#true} assume true; {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96564#true} {96564#true} #689#return; {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {96564#true} call #t~ret161 := main(); {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {96564#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {96564#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L272 TraceCheckUtils]: 7: Hoare triple {96564#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {96564#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {96564#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {96564#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {96564#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96564#true} is VALID [2022-04-28 15:24:54,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {96564#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {96564#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {96564#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {96564#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {96564#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {96564#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {96564#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {96564#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {96564#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {96564#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {96564#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {96564#true} assume 8464 == #t~mem55;havoc #t~mem55; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {96564#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {96564#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {96564#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {96564#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {96564#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {96564#true} ~skip~0 := 0; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {96564#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {96564#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {96564#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {96564#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {96564#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {96564#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {96564#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {96564#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {96564#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {96564#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {96564#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {96564#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {96564#true} assume 8496 == #t~mem58;havoc #t~mem58; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {96564#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {96564#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {96564#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {96564#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {96564#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {96564#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {96564#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {96564#true} ~skip~0 := 0; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {96564#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,211 INFO L290 TraceCheckUtils]: 55: Hoare triple {96564#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 56: Hoare triple {96564#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {96564#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {96564#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 59: Hoare triple {96564#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {96564#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {96564#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {96564#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {96564#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 64: Hoare triple {96564#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {96564#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 66: Hoare triple {96564#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 67: Hoare triple {96564#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 68: Hoare triple {96564#true} assume 8512 == #t~mem60;havoc #t~mem60; {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 69: Hoare triple {96564#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 70: Hoare triple {96564#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96564#true} is VALID [2022-04-28 15:24:54,213 INFO L290 TraceCheckUtils]: 71: Hoare triple {96564#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,214 INFO L290 TraceCheckUtils]: 72: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,214 INFO L290 TraceCheckUtils]: 73: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,214 INFO L290 TraceCheckUtils]: 74: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,215 INFO L290 TraceCheckUtils]: 75: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,215 INFO L290 TraceCheckUtils]: 76: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,215 INFO L290 TraceCheckUtils]: 77: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,215 INFO L290 TraceCheckUtils]: 78: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,216 INFO L290 TraceCheckUtils]: 79: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,216 INFO L290 TraceCheckUtils]: 80: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,216 INFO L290 TraceCheckUtils]: 81: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,217 INFO L290 TraceCheckUtils]: 84: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,219 INFO L290 TraceCheckUtils]: 88: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,219 INFO L290 TraceCheckUtils]: 89: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,219 INFO L290 TraceCheckUtils]: 90: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,220 INFO L290 TraceCheckUtils]: 91: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,220 INFO L290 TraceCheckUtils]: 92: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,220 INFO L290 TraceCheckUtils]: 93: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,221 INFO L290 TraceCheckUtils]: 94: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,221 INFO L290 TraceCheckUtils]: 95: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,221 INFO L290 TraceCheckUtils]: 96: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,222 INFO L290 TraceCheckUtils]: 97: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,222 INFO L290 TraceCheckUtils]: 98: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,222 INFO L290 TraceCheckUtils]: 99: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,223 INFO L290 TraceCheckUtils]: 100: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,223 INFO L290 TraceCheckUtils]: 101: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,223 INFO L290 TraceCheckUtils]: 102: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,224 INFO L290 TraceCheckUtils]: 103: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,224 INFO L290 TraceCheckUtils]: 104: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,224 INFO L290 TraceCheckUtils]: 105: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,224 INFO L290 TraceCheckUtils]: 106: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,225 INFO L290 TraceCheckUtils]: 107: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,225 INFO L290 TraceCheckUtils]: 108: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,225 INFO L290 TraceCheckUtils]: 109: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,226 INFO L290 TraceCheckUtils]: 110: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,226 INFO L290 TraceCheckUtils]: 111: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,226 INFO L290 TraceCheckUtils]: 112: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,227 INFO L290 TraceCheckUtils]: 113: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,227 INFO L290 TraceCheckUtils]: 114: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,227 INFO L290 TraceCheckUtils]: 115: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,228 INFO L290 TraceCheckUtils]: 116: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,228 INFO L290 TraceCheckUtils]: 117: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,228 INFO L290 TraceCheckUtils]: 118: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,229 INFO L290 TraceCheckUtils]: 119: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,229 INFO L290 TraceCheckUtils]: 120: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,229 INFO L290 TraceCheckUtils]: 121: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,230 INFO L290 TraceCheckUtils]: 122: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,230 INFO L290 TraceCheckUtils]: 123: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,230 INFO L290 TraceCheckUtils]: 124: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,230 INFO L290 TraceCheckUtils]: 125: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,231 INFO L290 TraceCheckUtils]: 126: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,231 INFO L290 TraceCheckUtils]: 127: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,231 INFO L290 TraceCheckUtils]: 128: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,232 INFO L290 TraceCheckUtils]: 129: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,232 INFO L290 TraceCheckUtils]: 130: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {96569#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:24:54,232 INFO L290 TraceCheckUtils]: 131: Hoare triple {96569#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {96565#false} is VALID [2022-04-28 15:24:54,233 INFO L290 TraceCheckUtils]: 132: Hoare triple {96565#false} assume !false; {96565#false} is VALID [2022-04-28 15:24:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 15:24:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:54,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444461472] [2022-04-28 15:24:54,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444461472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:54,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:54,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:54,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:54,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1400465451] [2022-04-28 15:24:54,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1400465451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:54,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:54,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980073882] [2022-04-28 15:24:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 133 [2022-04-28 15:24:54,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:54,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:24:54,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:54,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:54,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:54,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:54,302 INFO L87 Difference]: Start difference. First operand 980 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:24:57,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:01,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:05,795 INFO L93 Difference]: Finished difference Result 2418 states and 3582 transitions. [2022-04-28 15:25:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:25:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 133 [2022-04-28 15:25:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:25:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:25:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:25:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:25:05,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-28 15:25:06,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:06,293 INFO L225 Difference]: With dead ends: 2418 [2022-04-28 15:25:06,294 INFO L226 Difference]: Without dead ends: 1466 [2022-04-28 15:25:06,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:06,296 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:06,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:25:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-04-28 15:25:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2022-04-28 15:25:06,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:06,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1466 states. Second operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:06,828 INFO L74 IsIncluded]: Start isIncluded. First operand 1466 states. Second operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:06,829 INFO L87 Difference]: Start difference. First operand 1466 states. Second operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:06,882 INFO L93 Difference]: Finished difference Result 1466 states and 2168 transitions. [2022-04-28 15:25:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2168 transitions. [2022-04-28 15:25:06,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:06,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:06,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 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 1466 states. [2022-04-28 15:25:06,886 INFO L87 Difference]: Start difference. First operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 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 1466 states. [2022-04-28 15:25:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:06,941 INFO L93 Difference]: Finished difference Result 1466 states and 2168 transitions. [2022-04-28 15:25:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2168 transitions. [2022-04-28 15:25:06,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:06,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:06,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:06,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1459 states have (on average 1.4825222755311858) internal successors, (2163), 1459 states have internal predecessors, (2163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2167 transitions. [2022-04-28 15:25:07,038 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2167 transitions. Word has length 133 [2022-04-28 15:25:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:07,039 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2167 transitions. [2022-04-28 15:25:07,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 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 15:25:07,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1464 states and 2167 transitions. [2022-04-28 15:25:09,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2167 edges. 2167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2167 transitions. [2022-04-28 15:25:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:25:09,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:09,119 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:25:09,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:25:09,119 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 1 times [2022-04-28 15:25:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:09,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128633581] [2022-04-28 15:25:09,225 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:25:09,225 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 2 times [2022-04-28 15:25:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:09,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984990278] [2022-04-28 15:25:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:09,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {107275#(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(196, 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); {107269#true} is VALID [2022-04-28 15:25:09,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {107269#true} assume true; {107269#true} is VALID [2022-04-28 15:25:09,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107269#true} {107269#true} #689#return; {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {107269#true} call ULTIMATE.init(); {107275#(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 15:25:09,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {107275#(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(196, 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); {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {107269#true} assume true; {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107269#true} {107269#true} #689#return; {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {107269#true} call #t~ret161 := main(); {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {107269#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107269#true} is VALID [2022-04-28 15:25:09,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {107269#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L272 TraceCheckUtils]: 7: Hoare triple {107269#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {107269#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {107269#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {107269#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {107269#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {107269#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {107269#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {107269#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {107269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {107269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {107269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 19: Hoare triple {107269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {107269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {107269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {107269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {107269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {107269#true} assume 8464 == #t~mem55;havoc #t~mem55; {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {107269#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {107269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {107269#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {107269#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {107269#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {107269#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {107269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {107269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {107269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {107269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {107269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {107269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {107269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {107269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {107269#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {107269#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 43: Hoare triple {107269#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {107269#true} assume 8496 == #t~mem58;havoc #t~mem58; {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {107269#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {107269#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {107269#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {107269#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {107269#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {107269#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {107269#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {107269#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {107269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {107269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {107269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {107269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 59: Hoare triple {107269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {107269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {107269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {107269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {107269#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 64: Hoare triple {107269#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 65: Hoare triple {107269#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 66: Hoare triple {107269#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 67: Hoare triple {107269#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 68: Hoare triple {107269#true} assume 8512 == #t~mem60;havoc #t~mem60; {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 69: Hoare triple {107269#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 70: Hoare triple {107269#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {107269#true} is VALID [2022-04-28 15:25:09,369 INFO L290 TraceCheckUtils]: 71: Hoare triple {107269#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {107269#true} assume !(~ret~0 <= 0); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 73: Hoare triple {107269#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 74: Hoare triple {107269#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 75: Hoare triple {107269#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 76: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 77: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 78: Hoare triple {107269#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 79: Hoare triple {107269#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 80: Hoare triple {107269#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,370 INFO L290 TraceCheckUtils]: 81: Hoare triple {107269#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 82: Hoare triple {107269#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 83: Hoare triple {107269#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 84: Hoare triple {107269#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 85: Hoare triple {107269#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 86: Hoare triple {107269#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 87: Hoare triple {107269#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 88: Hoare triple {107269#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 89: Hoare triple {107269#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 90: Hoare triple {107269#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 91: Hoare triple {107269#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,371 INFO L290 TraceCheckUtils]: 92: Hoare triple {107269#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {107269#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {107269#true} assume 8528 == #t~mem62;havoc #t~mem62; {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 95: Hoare triple {107269#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~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, 332 + ~s.offset, 8); {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 96: Hoare triple {107269#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 97: Hoare triple {107269#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {107269#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107269#true} is VALID [2022-04-28 15:25:09,372 INFO L290 TraceCheckUtils]: 99: Hoare triple {107269#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107269#true} is VALID [2022-04-28 15:25:09,373 INFO L290 TraceCheckUtils]: 100: Hoare triple {107269#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,374 INFO L290 TraceCheckUtils]: 103: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,374 INFO L290 TraceCheckUtils]: 104: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,374 INFO L290 TraceCheckUtils]: 105: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,375 INFO L290 TraceCheckUtils]: 106: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,375 INFO L290 TraceCheckUtils]: 107: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,375 INFO L290 TraceCheckUtils]: 108: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,375 INFO L290 TraceCheckUtils]: 109: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,376 INFO L290 TraceCheckUtils]: 111: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,376 INFO L290 TraceCheckUtils]: 112: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,377 INFO L290 TraceCheckUtils]: 113: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,377 INFO L290 TraceCheckUtils]: 114: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,377 INFO L290 TraceCheckUtils]: 115: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,378 INFO L290 TraceCheckUtils]: 116: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,378 INFO L290 TraceCheckUtils]: 117: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,378 INFO L290 TraceCheckUtils]: 118: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,379 INFO L290 TraceCheckUtils]: 119: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,379 INFO L290 TraceCheckUtils]: 120: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,379 INFO L290 TraceCheckUtils]: 121: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,379 INFO L290 TraceCheckUtils]: 122: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,380 INFO L290 TraceCheckUtils]: 123: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,380 INFO L290 TraceCheckUtils]: 124: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,380 INFO L290 TraceCheckUtils]: 125: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,381 INFO L290 TraceCheckUtils]: 126: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,381 INFO L290 TraceCheckUtils]: 127: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,382 INFO L290 TraceCheckUtils]: 129: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,382 INFO L290 TraceCheckUtils]: 130: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,382 INFO L290 TraceCheckUtils]: 131: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #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; {107274#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:25:09,383 INFO L290 TraceCheckUtils]: 132: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {107270#false} is VALID [2022-04-28 15:25:09,383 INFO L290 TraceCheckUtils]: 133: Hoare triple {107270#false} assume !false; {107270#false} is VALID [2022-04-28 15:25:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 15:25:09,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:09,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984990278] [2022-04-28 15:25:09,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984990278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:09,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:09,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:09,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:09,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128633581] [2022-04-28 15:25:09,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128633581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:09,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:09,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:09,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521002145] [2022-04-28 15:25:09,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 134 [2022-04-28 15:25:09,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:09,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 15:25:09,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:09,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:25:09,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:09,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:25:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:09,462 INFO L87 Difference]: Start difference. First operand 1464 states and 2167 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 15:25:11,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:14,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:18,575 INFO L93 Difference]: Finished difference Result 1952 states and 2894 transitions. [2022-04-28 15:25:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:25:18,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 134 [2022-04-28 15:25:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 15:25:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:25:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 15:25:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:25:18,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-28 15:25:18,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:19,004 INFO L225 Difference]: With dead ends: 1952 [2022-04-28 15:25:19,005 INFO L226 Difference]: Without dead ends: 1950 [2022-04-28 15:25:19,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:19,006 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:19,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:25:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2022-04-28 15:25:20,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1948. [2022-04-28 15:25:20,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:20,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1950 states. Second operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand 1950 states. Second operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:20,163 INFO L87 Difference]: Start difference. First operand 1950 states. Second operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:20,255 INFO L93 Difference]: Finished difference Result 1950 states and 2892 transitions. [2022-04-28 15:25:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2892 transitions. [2022-04-28 15:25:20,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:20,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:20,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 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 1950 states. [2022-04-28 15:25:20,259 INFO L87 Difference]: Start difference. First operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 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 1950 states. [2022-04-28 15:25:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:20,351 INFO L93 Difference]: Finished difference Result 1950 states and 2892 transitions. [2022-04-28 15:25:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2892 transitions. [2022-04-28 15:25:20,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:20,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:20,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:20,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1943 states have (on average 1.4858466289243437) internal successors, (2887), 1943 states have internal predecessors, (2887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2891 transitions. [2022-04-28 15:25:20,526 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2891 transitions. Word has length 134 [2022-04-28 15:25:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:20,526 INFO L495 AbstractCegarLoop]: Abstraction has 1948 states and 2891 transitions. [2022-04-28 15:25:20,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 15:25:20,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1948 states and 2891 transitions. [2022-04-28 15:25:23,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2891 edges. 2891 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2891 transitions. [2022-04-28 15:25:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 15:25:23,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:23,370 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:25:23,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:25:23,370 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1009043547, now seen corresponding path program 1 times [2022-04-28 15:25:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:23,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181425118] [2022-04-28 15:25:23,483 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:25:23,483 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1009043547, now seen corresponding path program 2 times [2022-04-28 15:25:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125977547] [2022-04-28 15:25:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:23,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {118984#(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(196, 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); {118978#true} is VALID [2022-04-28 15:25:23,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {118978#true} assume true; {118978#true} is VALID [2022-04-28 15:25:23,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118978#true} {118978#true} #689#return; {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {118978#true} call ULTIMATE.init(); {118984#(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 15:25:23,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {118984#(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(196, 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); {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {118978#true} assume true; {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118978#true} {118978#true} #689#return; {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {118978#true} call #t~ret161 := main(); {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {118978#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {118978#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {118978#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {118978#true} is VALID [2022-04-28 15:25:23,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {118978#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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {118978#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {118978#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {118978#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {118978#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {118978#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {118978#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {118978#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {118978#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {118978#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {118978#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {118978#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {118978#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {118978#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {118978#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {118978#true} assume 8464 == #t~mem55;havoc #t~mem55; {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {118978#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {118978#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {118978#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {118978#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {118978#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {118978#true} ~skip~0 := 0; {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {118978#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {118978#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {118978#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {118978#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {118978#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {118978#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {118978#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {118978#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {118978#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {118978#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {118978#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {118978#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {118978#true} assume 8496 == #t~mem58;havoc #t~mem58; {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {118978#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {118978#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {118978#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {118978#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {118978#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {118978#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {118978#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {118978#true} ~skip~0 := 0; {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {118978#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {118978#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {118978#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {118978#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {118978#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {118978#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {118978#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {118978#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {118978#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {118978#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {118978#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {118978#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {118978#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {118978#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 68: Hoare triple {118978#true} assume 8512 == #t~mem60;havoc #t~mem60; {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {118978#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {118978#true} is VALID [2022-04-28 15:25:23,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {118978#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {118978#true} is VALID [2022-04-28 15:25:23,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {118978#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,621 INFO L290 TraceCheckUtils]: 76: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !false; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,622 INFO L290 TraceCheckUtils]: 80: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,623 INFO L290 TraceCheckUtils]: 83: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,624 INFO L290 TraceCheckUtils]: 85: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,624 INFO L290 TraceCheckUtils]: 86: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,625 INFO L290 TraceCheckUtils]: 87: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,625 INFO L290 TraceCheckUtils]: 88: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,625 INFO L290 TraceCheckUtils]: 89: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,626 INFO L290 TraceCheckUtils]: 91: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,626 INFO L290 TraceCheckUtils]: 93: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,627 INFO L290 TraceCheckUtils]: 95: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,627 INFO L290 TraceCheckUtils]: 96: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,628 INFO L290 TraceCheckUtils]: 97: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,628 INFO L290 TraceCheckUtils]: 98: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,628 INFO L290 TraceCheckUtils]: 99: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,629 INFO L290 TraceCheckUtils]: 101: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,629 INFO L290 TraceCheckUtils]: 102: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,630 INFO L290 TraceCheckUtils]: 104: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,630 INFO L290 TraceCheckUtils]: 105: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,631 INFO L290 TraceCheckUtils]: 106: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,631 INFO L290 TraceCheckUtils]: 107: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,632 INFO L290 TraceCheckUtils]: 110: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,632 INFO L290 TraceCheckUtils]: 111: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,632 INFO L290 TraceCheckUtils]: 112: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,633 INFO L290 TraceCheckUtils]: 113: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {118983#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:23,633 INFO L290 TraceCheckUtils]: 114: Hoare triple {118983#(<= 6 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {118979#false} is VALID [2022-04-28 15:25:23,633 INFO L290 TraceCheckUtils]: 115: Hoare triple {118979#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,633 INFO L290 TraceCheckUtils]: 116: Hoare triple {118979#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {118979#false} is VALID [2022-04-28 15:25:23,633 INFO L290 TraceCheckUtils]: 117: Hoare triple {118979#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 118: Hoare triple {118979#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 119: Hoare triple {118979#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 120: Hoare triple {118979#false} ~skip~0 := 0; {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 121: Hoare triple {118979#false} assume !false; {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 122: Hoare triple {118979#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 123: Hoare triple {118979#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 124: Hoare triple {118979#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 125: Hoare triple {118979#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 126: Hoare triple {118979#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 127: Hoare triple {118979#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,634 INFO L290 TraceCheckUtils]: 128: Hoare triple {118979#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 129: Hoare triple {118979#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 130: Hoare triple {118979#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 131: Hoare triple {118979#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 132: Hoare triple {118979#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 133: Hoare triple {118979#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 134: Hoare triple {118979#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 135: Hoare triple {118979#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 136: Hoare triple {118979#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 137: Hoare triple {118979#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 138: Hoare triple {118979#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,635 INFO L290 TraceCheckUtils]: 139: Hoare triple {118979#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 140: Hoare triple {118979#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 141: Hoare triple {118979#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 142: Hoare triple {118979#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 143: Hoare triple {118979#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 144: Hoare triple {118979#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 145: Hoare triple {118979#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 146: Hoare triple {118979#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 147: Hoare triple {118979#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 148: Hoare triple {118979#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 149: Hoare triple {118979#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 150: Hoare triple {118979#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {118979#false} is VALID [2022-04-28 15:25:23,636 INFO L290 TraceCheckUtils]: 151: Hoare triple {118979#false} assume 8640 == #t~mem75;havoc #t~mem75; {118979#false} is VALID [2022-04-28 15:25:23,637 INFO L290 TraceCheckUtils]: 152: Hoare triple {118979#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {118979#false} is VALID [2022-04-28 15:25:23,637 INFO L290 TraceCheckUtils]: 153: Hoare triple {118979#false} assume 4 == ~blastFlag~0; {118979#false} is VALID [2022-04-28 15:25:23,637 INFO L290 TraceCheckUtils]: 154: Hoare triple {118979#false} assume !false; {118979#false} is VALID [2022-04-28 15:25:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:25:23,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:23,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125977547] [2022-04-28 15:25:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125977547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:23,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181425118] [2022-04-28 15:25:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181425118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500767638] [2022-04-28 15:25:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:23,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 155 [2022-04-28 15:25:23,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:23,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 15:25:23,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:23,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:25:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:25:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:23,754 INFO L87 Difference]: Start difference. First operand 1948 states and 2891 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 15:25:26,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:28,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:31,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:35,570 INFO L93 Difference]: Finished difference Result 4354 states and 6474 transitions. [2022-04-28 15:25:35,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:25:35,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 155 [2022-04-28 15:25:35,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 15:25:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:25:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 15:25:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:25:35,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 605 transitions. [2022-04-28 15:25:35,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:36,217 INFO L225 Difference]: With dead ends: 4354 [2022-04-28 15:25:36,217 INFO L226 Difference]: Without dead ends: 2434 [2022-04-28 15:25:36,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:36,220 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 145 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:36,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 574 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:25:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-04-28 15:25:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2432. [2022-04-28 15:25:38,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:38,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2434 states. Second operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:38,456 INFO L74 IsIncluded]: Start isIncluded. First operand 2434 states. Second operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:38,457 INFO L87 Difference]: Start difference. First operand 2434 states. Second operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:38,600 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:25:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:25:38,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:38,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:38,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 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 2434 states. [2022-04-28 15:25:38,606 INFO L87 Difference]: Start difference. First operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 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 2434 states. [2022-04-28 15:25:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:38,748 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:25:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:25:38,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:38,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:38,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:38,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2427 states have (on average 1.4787803873094356) internal successors, (3589), 2427 states have internal predecessors, (3589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3593 transitions. [2022-04-28 15:25:39,040 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3593 transitions. Word has length 155 [2022-04-28 15:25:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:39,040 INFO L495 AbstractCegarLoop]: Abstraction has 2432 states and 3593 transitions. [2022-04-28 15:25:39,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 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 15:25:39,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2432 states and 3593 transitions. [2022-04-28 15:25:42,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3593 edges. 3593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3593 transitions. [2022-04-28 15:25:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:25:42,590 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:42,590 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:25:42,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:25:42,590 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2037465434, now seen corresponding path program 1 times [2022-04-28 15:25:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:42,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795529905] [2022-04-28 15:25:42,710 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:25:42,710 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2037465434, now seen corresponding path program 2 times [2022-04-28 15:25:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:42,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730896769] [2022-04-28 15:25:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:43,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {137436#(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(196, 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); {137427#true} is VALID [2022-04-28 15:25:43,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {137427#true} assume true; {137427#true} is VALID [2022-04-28 15:25:43,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137427#true} {137427#true} #689#return; {137427#true} is VALID [2022-04-28 15:25:43,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {137427#true} call ULTIMATE.init(); {137436#(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 15:25:43,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {137436#(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(196, 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); {137427#true} is VALID [2022-04-28 15:25:43,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {137427#true} assume true; {137427#true} is VALID [2022-04-28 15:25:43,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137427#true} {137427#true} #689#return; {137427#true} is VALID [2022-04-28 15:25:43,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {137427#true} call #t~ret161 := main(); {137427#true} is VALID [2022-04-28 15:25:43,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {137427#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {137427#true} is VALID [2022-04-28 15:25:43,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {137427#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {137432#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:25:43,189 INFO L272 TraceCheckUtils]: 7: Hoare triple {137432#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {137433#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:25:43,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {137433#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:25:43,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:25:43,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:25:43,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:25:43,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {137434#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {137435#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {137435#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {137428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {137428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {137428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {137428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {137428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {137428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {137428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {137428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {137428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {137428#false} assume 8464 == #t~mem55;havoc #t~mem55; {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {137428#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {137428#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {137428#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {137428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {137428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {137428#false} ~skip~0 := 0; {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {137428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {137428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {137428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {137428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {137428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {137428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {137428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {137428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {137428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {137428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {137428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {137428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {137428#false} assume 8496 == #t~mem58;havoc #t~mem58; {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {137428#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {137428#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {137428#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {137428#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {137428#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {137428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {137428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {137428#false} ~skip~0 := 0; {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {137428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {137428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {137428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {137428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {137428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {137428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {137428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {137428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {137428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {137428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {137428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {137428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {137428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {137428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {137428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {137428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {137428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {137428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,200 INFO L290 TraceCheckUtils]: 72: Hoare triple {137428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {137428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 74: Hoare triple {137428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {137428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 76: Hoare triple {137428#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {137428#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 78: Hoare triple {137428#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 79: Hoare triple {137428#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 80: Hoare triple {137428#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {137428#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {137428#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {137428#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {137428#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {137428#false} assume 8656 == #t~mem77;havoc #t~mem77; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {137428#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {137428#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {137428#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 89: Hoare triple {137428#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 90: Hoare triple {137428#false} assume !(0 == ~tmp___10~0); {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 91: Hoare triple {137428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 92: Hoare triple {137428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 93: Hoare triple {137428#false} ~skip~0 := 0; {137428#false} is VALID [2022-04-28 15:25:43,202 INFO L290 TraceCheckUtils]: 94: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 95: Hoare triple {137428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {137428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {137428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 98: Hoare triple {137428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 99: Hoare triple {137428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 100: Hoare triple {137428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 101: Hoare triple {137428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {137428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 103: Hoare triple {137428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 104: Hoare triple {137428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,203 INFO L290 TraceCheckUtils]: 105: Hoare triple {137428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {137428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {137428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {137428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 109: Hoare triple {137428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 110: Hoare triple {137428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 111: Hoare triple {137428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 112: Hoare triple {137428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 113: Hoare triple {137428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 114: Hoare triple {137428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 115: Hoare triple {137428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,204 INFO L290 TraceCheckUtils]: 116: Hoare triple {137428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 117: Hoare triple {137428#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 118: Hoare triple {137428#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 119: Hoare triple {137428#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 120: Hoare triple {137428#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 121: Hoare triple {137428#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 122: Hoare triple {137428#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 123: Hoare triple {137428#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 124: Hoare triple {137428#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 125: Hoare triple {137428#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 126: Hoare triple {137428#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,205 INFO L290 TraceCheckUtils]: 127: Hoare triple {137428#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 128: Hoare triple {137428#false} assume 8672 == #t~mem79;havoc #t~mem79; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 129: Hoare triple {137428#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 130: Hoare triple {137428#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 131: Hoare triple {137428#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 132: Hoare triple {137428#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 133: Hoare triple {137428#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 134: Hoare triple {137428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 135: Hoare triple {137428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 136: Hoare triple {137428#false} ~skip~0 := 0; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 137: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,206 INFO L290 TraceCheckUtils]: 138: Hoare triple {137428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 139: Hoare triple {137428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 140: Hoare triple {137428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 141: Hoare triple {137428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 142: Hoare triple {137428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 143: Hoare triple {137428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 144: Hoare triple {137428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 145: Hoare triple {137428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 146: Hoare triple {137428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 147: Hoare triple {137428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,207 INFO L290 TraceCheckUtils]: 148: Hoare triple {137428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 149: Hoare triple {137428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 150: Hoare triple {137428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 151: Hoare triple {137428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 152: Hoare triple {137428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 153: Hoare triple {137428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 154: Hoare triple {137428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 155: Hoare triple {137428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 156: Hoare triple {137428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 157: Hoare triple {137428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 158: Hoare triple {137428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,208 INFO L290 TraceCheckUtils]: 159: Hoare triple {137428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 160: Hoare triple {137428#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 161: Hoare triple {137428#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 162: Hoare triple {137428#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 163: Hoare triple {137428#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 164: Hoare triple {137428#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 165: Hoare triple {137428#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 166: Hoare triple {137428#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 167: Hoare triple {137428#false} assume 8640 == #t~mem75;havoc #t~mem75; {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 168: Hoare triple {137428#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 169: Hoare triple {137428#false} assume 4 == ~blastFlag~0; {137428#false} is VALID [2022-04-28 15:25:43,209 INFO L290 TraceCheckUtils]: 170: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:25:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-28 15:25:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:43,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730896769] [2022-04-28 15:25:43,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730896769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:43,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:43,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:25:43,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:43,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795529905] [2022-04-28 15:25:43,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795529905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:43,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:43,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:25:43,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784529430] [2022-04-28 15:25:43,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-28 15:25:43,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:43,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:43,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:25:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:25:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:25:43,283 INFO L87 Difference]: Start difference. First operand 2432 states and 3593 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:25:47,076 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:50,411 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 15:25:52,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:56,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:01,499 INFO L93 Difference]: Finished difference Result 4857 states and 7178 transitions. [2022-04-28 15:26:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:26:01,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-28 15:26:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:26:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:26:01,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-28 15:26:01,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:02,009 INFO L225 Difference]: With dead ends: 4857 [2022-04-28 15:26:02,009 INFO L226 Difference]: Without dead ends: 2432 [2022-04-28 15:26:02,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:26:02,012 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:02,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-04-28 15:26:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-04-28 15:26:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2432. [2022-04-28 15:26:04,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:04,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2432 states. Second operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:04,289 INFO L74 IsIncluded]: Start isIncluded. First operand 2432 states. Second operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:04,290 INFO L87 Difference]: Start difference. First operand 2432 states. Second operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:04,433 INFO L93 Difference]: Finished difference Result 2432 states and 3592 transitions. [2022-04-28 15:26:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3592 transitions. [2022-04-28 15:26:04,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:04,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:04,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 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 2432 states. [2022-04-28 15:26:04,437 INFO L87 Difference]: Start difference. First operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 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 2432 states. [2022-04-28 15:26:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:04,576 INFO L93 Difference]: Finished difference Result 2432 states and 3592 transitions. [2022-04-28 15:26:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3592 transitions. [2022-04-28 15:26:04,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:04,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:04,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:04,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2432 states, 2427 states have (on average 1.4783683559950556) internal successors, (3588), 2427 states have internal predecessors, (3588), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3592 transitions. [2022-04-28 15:26:04,834 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3592 transitions. Word has length 171 [2022-04-28 15:26:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:04,835 INFO L495 AbstractCegarLoop]: Abstraction has 2432 states and 3592 transitions. [2022-04-28 15:26:04,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:04,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2432 states and 3592 transitions. [2022-04-28 15:26:08,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3592 edges. 3592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3592 transitions. [2022-04-28 15:26:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:26:08,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:08,428 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 15:26:08,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 15:26:08,429 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 114215004, now seen corresponding path program 1 times [2022-04-28 15:26:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:08,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [674851631] [2022-04-28 15:26:08,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:26:08,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:26:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 114215004, now seen corresponding path program 2 times [2022-04-28 15:26:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:08,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015383775] [2022-04-28 15:26:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:10,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {156902#(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(196, 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); {156887#true} is VALID [2022-04-28 15:26:10,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {156887#true} assume true; {156887#true} is VALID [2022-04-28 15:26:10,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156887#true} {156887#true} #689#return; {156887#true} is VALID [2022-04-28 15:26:10,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {156887#true} call ULTIMATE.init(); {156902#(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 15:26:10,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {156902#(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(196, 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); {156887#true} is VALID [2022-04-28 15:26:10,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {156887#true} assume true; {156887#true} is VALID [2022-04-28 15:26:10,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156887#true} {156887#true} #689#return; {156887#true} is VALID [2022-04-28 15:26:10,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {156887#true} call #t~ret161 := main(); {156887#true} is VALID [2022-04-28 15:26:10,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {156887#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~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(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #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, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {156892#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))))} is VALID [2022-04-28 15:26:10,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {156892#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 204 + ~s~0.offset, 8);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem28.base, 68 + #t~mem28.offset, 8);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {156893#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))) (<= main_~s~0.offset 0))} is VALID [2022-04-28 15:26:10,110 INFO L272 TraceCheckUtils]: 7: Hoare triple {156893#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))) (<= main_~s~0.offset 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156894#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))) 888) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))) (<= |ssl3_accept_#in~s.offset| (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)) 0) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-28 15:26:10,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {156894#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))) 888) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))) (<= |ssl3_accept_#in~s.offset| (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)) 0) (<= |ssl3_accept_#in~s.offset| 0))} ~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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~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, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~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, 272 + ~s.offset, 8); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !false; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 8464 == #t~mem55;havoc #t~mem55; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} ~skip~0 := 0; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !false; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,141 INFO L290 TraceCheckUtils]: 41: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,142 INFO L290 TraceCheckUtils]: 42: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,143 INFO L290 TraceCheckUtils]: 43: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,143 INFO L290 TraceCheckUtils]: 44: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 8496 == #t~mem58;havoc #t~mem58; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {156895#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} ~skip~0 := 0; {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !false; {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,151 INFO L290 TraceCheckUtils]: 56: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,157 INFO L290 TraceCheckUtils]: 67: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,158 INFO L290 TraceCheckUtils]: 69: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,159 INFO L290 TraceCheckUtils]: 71: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,159 INFO L290 TraceCheckUtils]: 72: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,167 INFO L290 TraceCheckUtils]: 83: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,168 INFO L290 TraceCheckUtils]: 84: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume 8656 == #t~mem77;havoc #t~mem77; {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {156896#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,170 INFO L290 TraceCheckUtils]: 88: Hoare triple {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,171 INFO L290 TraceCheckUtils]: 89: Hoare triple {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,171 INFO L290 TraceCheckUtils]: 90: Hoare triple {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == ~tmp___10~0); {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:26:10,172 INFO L290 TraceCheckUtils]: 91: Hoare triple {156897#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,172 INFO L290 TraceCheckUtils]: 92: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,172 INFO L290 TraceCheckUtils]: 93: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} ~skip~0 := 0; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,172 INFO L290 TraceCheckUtils]: 94: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !false; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,173 INFO L290 TraceCheckUtils]: 95: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,173 INFO L290 TraceCheckUtils]: 96: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,173 INFO L290 TraceCheckUtils]: 97: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,174 INFO L290 TraceCheckUtils]: 99: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,174 INFO L290 TraceCheckUtils]: 100: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,178 INFO L290 TraceCheckUtils]: 102: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,179 INFO L290 TraceCheckUtils]: 103: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,179 INFO L290 TraceCheckUtils]: 104: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,179 INFO L290 TraceCheckUtils]: 105: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,180 INFO L290 TraceCheckUtils]: 106: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,180 INFO L290 TraceCheckUtils]: 107: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,180 INFO L290 TraceCheckUtils]: 108: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,180 INFO L290 TraceCheckUtils]: 109: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,181 INFO L290 TraceCheckUtils]: 110: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,181 INFO L290 TraceCheckUtils]: 111: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,181 INFO L290 TraceCheckUtils]: 112: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,182 INFO L290 TraceCheckUtils]: 113: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,182 INFO L290 TraceCheckUtils]: 114: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,182 INFO L290 TraceCheckUtils]: 115: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,182 INFO L290 TraceCheckUtils]: 116: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,183 INFO L290 TraceCheckUtils]: 117: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,183 INFO L290 TraceCheckUtils]: 118: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,183 INFO L290 TraceCheckUtils]: 119: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,184 INFO L290 TraceCheckUtils]: 120: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,184 INFO L290 TraceCheckUtils]: 121: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,184 INFO L290 TraceCheckUtils]: 122: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,184 INFO L290 TraceCheckUtils]: 123: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,185 INFO L290 TraceCheckUtils]: 124: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,185 INFO L290 TraceCheckUtils]: 125: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,185 INFO L290 TraceCheckUtils]: 126: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,186 INFO L290 TraceCheckUtils]: 127: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,186 INFO L290 TraceCheckUtils]: 128: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume 8672 == #t~mem79;havoc #t~mem79; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,186 INFO L290 TraceCheckUtils]: 129: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,186 INFO L290 TraceCheckUtils]: 130: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:26:10,187 INFO L290 TraceCheckUtils]: 131: Hoare triple {156898#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {156899#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))) (not (= ssl3_accept_~s.offset (+ 832 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))))} is VALID [2022-04-28 15:26:10,188 INFO L290 TraceCheckUtils]: 132: Hoare triple {156899#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))) (not (= ssl3_accept_~s.offset (+ 832 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,189 INFO L290 TraceCheckUtils]: 133: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,189 INFO L290 TraceCheckUtils]: 134: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,190 INFO L290 TraceCheckUtils]: 135: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,190 INFO L290 TraceCheckUtils]: 136: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,190 INFO L290 TraceCheckUtils]: 137: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,191 INFO L290 TraceCheckUtils]: 138: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,191 INFO L290 TraceCheckUtils]: 139: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,191 INFO L290 TraceCheckUtils]: 140: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,193 INFO L290 TraceCheckUtils]: 143: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,193 INFO L290 TraceCheckUtils]: 144: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,193 INFO L290 TraceCheckUtils]: 145: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,194 INFO L290 TraceCheckUtils]: 146: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,194 INFO L290 TraceCheckUtils]: 147: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,194 INFO L290 TraceCheckUtils]: 148: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,195 INFO L290 TraceCheckUtils]: 149: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,195 INFO L290 TraceCheckUtils]: 150: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,196 INFO L290 TraceCheckUtils]: 151: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,196 INFO L290 TraceCheckUtils]: 152: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,196 INFO L290 TraceCheckUtils]: 153: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,197 INFO L290 TraceCheckUtils]: 154: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,197 INFO L290 TraceCheckUtils]: 155: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,197 INFO L290 TraceCheckUtils]: 156: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,198 INFO L290 TraceCheckUtils]: 157: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,198 INFO L290 TraceCheckUtils]: 158: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:10,199 INFO L290 TraceCheckUtils]: 159: Hoare triple {156900#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {156901#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-28 15:26:10,200 INFO L290 TraceCheckUtils]: 160: Hoare triple {156901#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,200 INFO L290 TraceCheckUtils]: 161: Hoare triple {156888#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,200 INFO L290 TraceCheckUtils]: 162: Hoare triple {156888#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,200 INFO L290 TraceCheckUtils]: 163: Hoare triple {156888#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 164: Hoare triple {156888#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 165: Hoare triple {156888#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 166: Hoare triple {156888#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 167: Hoare triple {156888#false} assume 8640 == #t~mem75;havoc #t~mem75; {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 168: Hoare triple {156888#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 169: Hoare triple {156888#false} assume 4 == ~blastFlag~0; {156888#false} is VALID [2022-04-28 15:26:10,201 INFO L290 TraceCheckUtils]: 170: Hoare triple {156888#false} assume !false; {156888#false} is VALID [2022-04-28 15:26:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:26:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:10,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015383775] [2022-04-28 15:26:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015383775] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:26:10,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099763019] [2022-04-28 15:26:10,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 15:26:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:26:10,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:26:10,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 15:26:10,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 15:26:39,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 15:26:39,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:26:39,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 163 conjunts are in the unsatisfiable core [2022-04-28 15:26:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:39,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 15:26:39,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:26:39,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5362 treesize of output 788 [2022-04-28 15:26:42,730 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 15:26:42,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 15:26:42,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 15:26:42,944 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:825) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:786) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:704) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) 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 15:26:42,948 INFO L158 Benchmark]: Toolchain (without parser) took 441564.95ms. Allocated memory was 196.1MB in the beginning and 423.6MB in the end (delta: 227.5MB). Free memory was 137.6MB in the beginning and 270.6MB in the end (delta: -133.1MB). Peak memory consumption was 269.1MB. Max. memory is 8.0GB. [2022-04-28 15:26:42,948 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 196.1MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:26:42,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.57ms. Allocated memory was 196.1MB in the beginning and 244.3MB in the end (delta: 48.2MB). Free memory was 137.5MB in the beginning and 190.9MB in the end (delta: -53.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-28 15:26:42,948 INFO L158 Benchmark]: Boogie Preprocessor took 136.90ms. Allocated memory is still 244.3MB. Free memory was 190.9MB in the beginning and 180.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:26:42,949 INFO L158 Benchmark]: RCFGBuilder took 1404.47ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 87.6MB in the end (delta: 93.3MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2022-04-28 15:26:42,949 INFO L158 Benchmark]: TraceAbstraction took 439417.41ms. Allocated memory was 244.3MB in the beginning and 423.6MB in the end (delta: 179.3MB). Free memory was 87.1MB in the beginning and 270.6MB in the end (delta: -183.6MB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. [2022-04-28 15:26:42,949 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.15ms. Allocated memory is still 196.1MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 600.57ms. Allocated memory was 196.1MB in the beginning and 244.3MB in the end (delta: 48.2MB). Free memory was 137.5MB in the beginning and 190.9MB in the end (delta: -53.4MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 136.90ms. Allocated memory is still 244.3MB. Free memory was 190.9MB in the beginning and 180.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1404.47ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 87.6MB in the end (delta: 93.3MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. * TraceAbstraction took 439417.41ms. Allocated memory was 244.3MB in the beginning and 423.6MB in the end (delta: 179.3MB). Free memory was 87.1MB in the beginning and 270.6MB in the end (delta: -183.6MB). Peak memory consumption was 171.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 15:26:42,996 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...