/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:19:01,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:19:01,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:19:01,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:19:01,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:19:01,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:19:01,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:19:01,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:19:01,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:19:01,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:19:01,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:19:01,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:19:01,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:19:01,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:19:01,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:19:01,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:19:01,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:19:01,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:19:01,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:19:01,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:19:01,467 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:19:01,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:19:01,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:19:01,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:19:01,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:19:01,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:19:01,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:19:01,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:19:01,477 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:19:01,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:19:01,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:19:01,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:19:01,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:19:01,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:19:01,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:19:01,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:19:01,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:19:01,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:19:01,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:19:01,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:19:01,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:19:01,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:19:01,491 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:01,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:19:01,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:19:01,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:19:01,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:19:01,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:19:01,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:19:01,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:19:01,508 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:19:01,509 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:19:01,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:19:01,509 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:19:01,509 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:01,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:19:01,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:19:01,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:19:01,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:19:01,776 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:19:01,778 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-1.c [2022-04-28 15:19:01,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d7ebdb8/cabd5cb1d2324de789aa7f9c4490371a/FLAGcd04c7bee [2022-04-28 15:19:02,402 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:19:02,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.07.i.cil-1.c [2022-04-28 15:19:02,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d7ebdb8/cabd5cb1d2324de789aa7f9c4490371a/FLAGcd04c7bee [2022-04-28 15:19:02,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d7ebdb8/cabd5cb1d2324de789aa7f9c4490371a [2022-04-28 15:19:02,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:19:02,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:19:02,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:19:02,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:19:02,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:19:02,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:19:02" (1/1) ... [2022-04-28 15:19:02,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2890ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:02, skipping insertion in model container [2022-04-28 15:19:02,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:19:02" (1/1) ... [2022-04-28 15:19:02,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:19:02,888 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:19:03,274 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-1.c[74369,74382] [2022-04-28 15:19:03,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:19:03,306 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:19:03,433 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-1.c[74369,74382] [2022-04-28 15:19:03,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:19:03,463 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:19:03,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:03 WrapperNode [2022-04-28 15:19:03,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:19:03,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:19:03,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:19:03,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:19:03,475 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:03" (1/1) ... [2022-04-28 15:19:03,476 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:03" (1/1) ... [2022-04-28 15:19:03,507 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:03" (1/1) ... [2022-04-28 15:19:03,508 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:03" (1/1) ... [2022-04-28 15:19:03,565 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:03" (1/1) ... [2022-04-28 15:19:03,576 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:03" (1/1) ... [2022-04-28 15:19:03,579 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:03" (1/1) ... [2022-04-28 15:19:03,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:19:03,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:19:03,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:19:03,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:19:03,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:03" (1/1) ... [2022-04-28 15:19:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:19:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:19:03,628 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:03,653 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:03,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:19:03,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:19:03,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:19:03,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:19:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:19:03,672 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:19:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:19:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:19:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:19:03,674 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:19:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:19:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:19:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:19:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:19:03,895 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:19:03,896 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:19:04,499 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:19:05,047 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:19:05,048 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:19:05,060 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:19:05,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:19:05,071 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:19:05,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:19:05 BoogieIcfgContainer [2022-04-28 15:19:05,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:19:05,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:19:05,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:19:05,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:19:05,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:19:02" (1/3) ... [2022-04-28 15:19:05,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2634ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:19:05, skipping insertion in model container [2022-04-28 15:19:05,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:19:03" (2/3) ... [2022-04-28 15:19:05,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2634ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:19:05, skipping insertion in model container [2022-04-28 15:19:05,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:19:05" (3/3) ... [2022-04-28 15:19:05,086 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-1.c [2022-04-28 15:19:05,104 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:19:05,104 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:19:05,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:19:05,177 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@77ef7022, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e5909e2 [2022-04-28 15:19:05,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:19:05,188 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:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 15:19:05,196 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:05,197 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:05,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-28 15:19:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:05,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456077441] [2022-04-28 15:19:05,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-28 15:19:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:05,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687226784] [2022-04-28 15:19:05,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:05,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:05,847 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:05,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:19:05,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:19:05,850 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:05,850 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:05,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:19:05,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:19:05,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 15:19:05,851 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:05,852 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:05,852 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:05,859 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:05,862 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:05,863 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:05,864 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:05,865 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:05,865 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:05,866 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:05,867 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:05,867 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:05,868 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:05,869 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:05,869 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:05,870 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:05,871 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:05,871 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:05,872 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:05,874 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:05,874 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:05,875 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:05,875 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:05,877 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:05,878 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:05,883 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:05,884 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:05,885 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:05,885 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:05,886 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:05,887 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:05,887 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:05,887 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:05,888 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:05,888 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:05,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 15:19:05,889 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 15:19:05,890 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:05,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:05,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687226784] [2022-04-28 15:19:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687226784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:05,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:05,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:05,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:05,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456077441] [2022-04-28 15:19:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456077441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:05,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421050178] [2022-04-28 15:19:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:05,903 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:05,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:05,909 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:05,962 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:05,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:05,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:05,994 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:13,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:18,331 INFO L93 Difference]: Finished difference Result 428 states and 723 transitions. [2022-04-28 15:19:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:18,331 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:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:18,333 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:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 15:19:18,347 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:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-04-28 15:19:18,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 723 transitions. [2022-04-28 15:19:18,926 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:18,944 INFO L225 Difference]: With dead ends: 428 [2022-04-28 15:19:18,944 INFO L226 Difference]: Without dead ends: 259 [2022-04-28 15:19:18,947 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:18,950 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:18,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:19:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-28 15:19:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 170. [2022-04-28 15:19:18,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:18,991 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:18,992 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:18,992 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:19,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:19,005 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 15:19:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 15:19:19,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:19,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:19,008 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:19,008 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:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:19,020 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2022-04-28 15:19:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2022-04-28 15:19:19,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:19,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:19,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:19,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:19,022 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:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 15:19:19,030 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 15:19:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:19,030 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 15:19:19,031 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:19,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 15:19:19,242 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:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 15:19:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 15:19:19,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:19,244 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:19,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:19:19,244 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-28 15:19:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:19,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642758606] [2022-04-28 15:19:19,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-28 15:19:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405593780] [2022-04-28 15:19:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:19,427 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:19,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 15:19:19,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 15:19:19,429 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:19,429 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:19,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-04-28 15:19:19,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1887#true} {1887#true} #689#return; {1887#true} is VALID [2022-04-28 15:19:19,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1887#true} call #t~ret161 := main(); {1887#true} is VALID [2022-04-28 15:19:19,430 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:19,430 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:19,430 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:19,435 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:19,436 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:19,448 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:19,449 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:19,449 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:19,450 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:19,450 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:19,451 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:19,452 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:19,452 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:19,453 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:19,453 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:19,454 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:19,454 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:19,455 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:19,455 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:19,455 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:19,456 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:19,456 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:19,457 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:19,457 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:19,458 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:19,458 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:19,459 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:19,459 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:19,460 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:19,460 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:19,460 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:19,460 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:19,461 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:19,461 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:19,461 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:19,461 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:19,461 INFO L290 TraceCheckUtils]: 41: Hoare triple {1888#false} assume 8 == ~blastFlag~0; {1888#false} is VALID [2022-04-28 15:19:19,461 INFO L290 TraceCheckUtils]: 42: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-04-28 15:19:19,462 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:19,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:19,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405593780] [2022-04-28 15:19:19,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405593780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:19,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:19,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:19,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642758606] [2022-04-28 15:19:19,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642758606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:19,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:19,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231080696] [2022-04-28 15:19:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:19,464 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:19,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:19,465 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:19,507 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:19,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:19,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:19,508 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:22,959 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:19:26,255 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:28,284 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:19:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:29,776 INFO L93 Difference]: Finished difference Result 442 states and 693 transitions. [2022-04-28 15:19:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:29,776 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:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:29,777 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:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:29,784 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:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:29,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:19:30,255 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:30,262 INFO L225 Difference]: With dead ends: 442 [2022-04-28 15:19:30,262 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 15:19:30,263 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:30,264 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:30,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 475 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 15:19:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 15:19:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 199. [2022-04-28 15:19:30,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:30,280 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:30,280 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:30,281 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:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:30,299 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 15:19:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 15:19:30,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:30,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:30,300 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:30,301 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:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:30,319 INFO L93 Difference]: Finished difference Result 287 states and 446 transitions. [2022-04-28 15:19:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 446 transitions. [2022-04-28 15:19:30,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:30,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:30,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:30,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:30,320 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:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 15:19:30,331 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 15:19:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:30,331 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 15:19:30,331 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:30,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 15:19:30,593 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:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 15:19:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 15:19:30,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:30,594 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:30,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:19:30,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:30,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-28 15:19:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:30,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172597133] [2022-04-28 15:19:30,596 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-28 15:19:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:30,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654926205] [2022-04-28 15:19:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:30,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:30,747 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:30,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 15:19:30,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 15:19:30,748 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:30,749 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:30,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3755#true} assume true; {3755#true} is VALID [2022-04-28 15:19:30,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3755#true} {3755#true} #689#return; {3755#true} is VALID [2022-04-28 15:19:30,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3755#true} call #t~ret161 := main(); {3755#true} is VALID [2022-04-28 15:19:30,749 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:30,749 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:30,749 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:30,752 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:30,753 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:30,753 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:30,754 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:30,754 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:30,755 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:30,755 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:30,756 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:30,756 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:30,757 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:30,757 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:30,758 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:30,758 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:30,759 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:30,759 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:30,760 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:30,760 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:30,761 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:30,761 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:30,762 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:30,762 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:30,763 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:30,763 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:30,764 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:30,764 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:30,765 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:30,765 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:30,766 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:30,766 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:30,767 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:30,767 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:30,768 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:30,768 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:30,769 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:30,769 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:30,770 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:30,770 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:30,770 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:30,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#false} assume 5 == ~blastFlag~0; {3756#false} is VALID [2022-04-28 15:19:30,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#false} assume !false; {3756#false} is VALID [2022-04-28 15:19:30,771 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:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:30,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654926205] [2022-04-28 15:19:30,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654926205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:30,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:30,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:30,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:30,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172597133] [2022-04-28 15:19:30,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172597133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:30,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:30,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450308718] [2022-04-28 15:19:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:30,773 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:30,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:30,773 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:30,811 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:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:30,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:30,812 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:37,135 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:19:39,140 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:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:40,394 INFO L93 Difference]: Finished difference Result 501 states and 796 transitions. [2022-04-28 15:19:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:40,395 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:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:40,395 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:40,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:40,401 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:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:19:40,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:19:40,825 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:40,833 INFO L225 Difference]: With dead ends: 501 [2022-04-28 15:19:40,833 INFO L226 Difference]: Without dead ends: 317 [2022-04-28 15:19:40,834 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:40,835 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:40,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 15:19:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-28 15:19:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 239. [2022-04-28 15:19:40,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:40,852 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:40,853 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:40,853 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:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:40,863 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 15:19:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 15:19:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:40,865 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:40,865 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:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:40,875 INFO L93 Difference]: Finished difference Result 317 states and 497 transitions. [2022-04-28 15:19:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 497 transitions. [2022-04-28 15:19:40,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:40,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:40,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:40,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:40,876 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:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 15:19:40,883 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 15:19:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:40,883 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 15:19:40,883 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:40,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 15:19:41,182 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:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 15:19:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 15:19:41,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:41,183 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:41,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:19:41,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-28 15:19:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:41,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345163667] [2022-04-28 15:19:41,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:19:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-28 15:19:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:41,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984885353] [2022-04-28 15:19:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:41,380 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:41,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 15:19:41,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 15:19:41,381 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:41,381 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:41,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {5881#true} assume true; {5881#true} is VALID [2022-04-28 15:19:41,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5881#true} {5881#true} #689#return; {5881#true} is VALID [2022-04-28 15:19:41,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {5881#true} call #t~ret161 := main(); {5881#true} is VALID [2022-04-28 15:19:41,382 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:41,382 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:41,382 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:41,384 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:41,385 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:41,385 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:41,386 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:41,386 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:41,387 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:41,387 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:41,388 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:41,388 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:41,388 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:41,389 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:41,389 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:41,391 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:41,391 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:41,392 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:41,392 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:41,392 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:41,393 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:41,393 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:41,393 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:41,394 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:41,394 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:41,394 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:41,394 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:41,394 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:41,394 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:41,394 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:41,394 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:41,395 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:41,395 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:41,396 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:41,396 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:41,396 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:41,396 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:41,397 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:41,397 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:41,397 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:41,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {5882#false} assume 8641 == #t~mem76;havoc #t~mem76; {5882#false} is VALID [2022-04-28 15:19:41,397 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:41,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {5882#false} assume 5 == ~blastFlag~0; {5882#false} is VALID [2022-04-28 15:19:41,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#false} assume !false; {5882#false} is VALID [2022-04-28 15:19:41,398 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:41,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:41,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984885353] [2022-04-28 15:19:41,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984885353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:41,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:41,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:41,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:41,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345163667] [2022-04-28 15:19:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345163667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:41,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:41,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577524401] [2022-04-28 15:19:41,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:41,400 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:41,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:41,402 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:41,447 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:41,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:41,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:41,449 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:19:43,475 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:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:44,553 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-28 15:19:44,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:44,553 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:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:44,554 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:19:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:19:44,557 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:19:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:19:44,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:19:44,892 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:19:44,898 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:19:44,898 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:19:44,898 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:44,899 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:44,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:19:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:19:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:19:44,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:44,922 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:19:44,923 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:19:44,923 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:19:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:44,929 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:19:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:19:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:44,931 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:19:44,932 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:19:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:44,938 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:19:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:19:44,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:44,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:44,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:44,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:44,940 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:19:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-28 15:19:44,946 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-28 15:19:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:44,946 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-28 15:19:44,946 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:19:44,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-28 15:19:45,243 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:19:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-28 15:19:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 15:19:45,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:45,244 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:19:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:19:45,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 1 times [2022-04-28 15:19:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:45,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32607250] [2022-04-28 15:19:45,288 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:45,288 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 2 times [2022-04-28 15:19:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:45,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677176273] [2022-04-28 15:19:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:45,435 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:19:45,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 15:19:45,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-28 15:19:45,437 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:19:45,437 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:19:45,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 15:19:45,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7909#true} {7909#true} #689#return; {7909#true} is VALID [2022-04-28 15:19:45,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {7909#true} call #t~ret161 := main(); {7909#true} is VALID [2022-04-28 15:19:45,437 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:19:45,438 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:19:45,438 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:19:45,442 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:19:45,443 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:19:45,444 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:19:45,445 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:19:45,445 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:19:45,446 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:19:45,446 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:19:45,447 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:19:45,447 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:19:45,447 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:19:45,448 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:19:45,448 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:19:45,449 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:19:45,449 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:19:45,450 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:19:45,450 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:19:45,450 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:19:45,450 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:19:45,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {7910#false} ~skip~0 := 0; {7910#false} is VALID [2022-04-28 15:19:45,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-28 15:19:45,450 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:19:45,450 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:19:45,450 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,451 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,452 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,453 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:19:45,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#false} assume 8641 == #t~mem76;havoc #t~mem76; {7910#false} is VALID [2022-04-28 15:19:45,454 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:19:45,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {7910#false} assume 5 == ~blastFlag~0; {7910#false} is VALID [2022-04-28 15:19:45,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-28 15:19:45,454 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:19:45,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677176273] [2022-04-28 15:19:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677176273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:45,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:45,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:45,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:45,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32607250] [2022-04-28 15:19:45,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32607250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:45,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:45,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721150304] [2022-04-28 15:19:45,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:45,456 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:19:45,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:45,456 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:19:45,512 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:19:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:45,513 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:19:47,950 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:19:49,957 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:51,984 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:19:54,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:19:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:55,630 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-28 15:19:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:19:55,630 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:19:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:19:55,630 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:19:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:19:55,634 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:19:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:19:55,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:19:55,989 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:19:55,995 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:19:55,995 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:19:55,995 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,996 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:19:55,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-28 15:19:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:19:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:19:56,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:19:56,008 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:19:56,008 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:19:56,009 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:19:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:56,015 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:19:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:19:56,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:56,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:56,016 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:19:56,017 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:19:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:19:56,022 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:19:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:19:56,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:19:56,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:19:56,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:19:56,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:19:56,024 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:19:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-28 15:19:56,030 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-28 15:19:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:19:56,030 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-28 15:19:56,030 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:19:56,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-28 15:19:56,316 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:19:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-28 15:19:56,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:19:56,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:19:56,317 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:19:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:19:56,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:19:56,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:19:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 1 times [2022-04-28 15:19:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:56,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964572838] [2022-04-28 15:19:56,341 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:19:56,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:19:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 2 times [2022-04-28 15:19:56,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:19:56,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120231726] [2022-04-28 15:19:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:19:56,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:19:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:19:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:19:56,499 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:19:56,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-28 15:19:56,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-28 15:19:56,500 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:19:56,500 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:19:56,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {9937#true} assume true; {9937#true} is VALID [2022-04-28 15:19:56,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9937#true} {9937#true} #689#return; {9937#true} is VALID [2022-04-28 15:19:56,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {9937#true} call #t~ret161 := main(); {9937#true} is VALID [2022-04-28 15:19:56,501 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:19:56,501 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:19:56,501 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:19:56,503 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:19:56,504 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:19:56,505 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:19:56,505 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:19:56,506 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:19:56,506 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:19:56,507 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:19:56,507 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:19:56,508 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:19:56,508 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:19:56,508 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:19:56,508 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:19:56,508 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:19:56,508 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:19:56,508 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:19:56,509 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:19:56,509 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:19:56,509 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:19:56,509 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:19:56,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {9938#false} ~skip~0 := 0; {9938#false} is VALID [2022-04-28 15:19:56,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-28 15:19:56,509 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:19:56,509 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:19:56,509 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,510 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,511 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,512 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:19:56,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {9938#false} assume 8641 == #t~mem76;havoc #t~mem76; {9938#false} is VALID [2022-04-28 15:19:56,513 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:19:56,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {9938#false} assume 5 == ~blastFlag~0; {9938#false} is VALID [2022-04-28 15:19:56,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {9938#false} assume !false; {9938#false} is VALID [2022-04-28 15:19:56,513 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:19:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:19:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120231726] [2022-04-28 15:19:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120231726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:56,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:56,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:19:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964572838] [2022-04-28 15:19:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964572838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:19:56,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:19:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:19:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987154824] [2022-04-28 15:19:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:19:56,516 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:19:56,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:19:56,516 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:19:56,575 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:19:56,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:19:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:19:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:19:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:19:56,578 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:19:58,604 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:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:00,021 INFO L93 Difference]: Finished difference Result 561 states and 903 transitions. [2022-04-28 15:20:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:00,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:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:00,021 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:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:20:00,025 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:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:20:00,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 15:20:00,508 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:00,517 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:00,517 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:00,518 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:00,520 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:00,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:20:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:00,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:00,536 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:00,536 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:00,537 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:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:00,544 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-28 15:20:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-28 15:20:00,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:00,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:00,546 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:00,546 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:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:00,555 INFO L93 Difference]: Finished difference Result 337 states and 530 transitions. [2022-04-28 15:20:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 530 transitions. [2022-04-28 15:20:00,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:00,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:00,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:00,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:00,556 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:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-28 15:20:00,562 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-28 15:20:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:00,562 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-28 15:20:00,564 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:00,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-28 15:20:00,872 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:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-28 15:20:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:00,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:00,873 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:00,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:20:00,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 1 times [2022-04-28 15:20:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:00,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [318621959] [2022-04-28 15:20:00,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:00,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 2 times [2022-04-28 15:20:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506904610] [2022-04-28 15:20:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:01,023 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:01,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 15:20:01,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12245#true} {12245#true} #689#return; {12245#true} is VALID [2022-04-28 15:20:01,025 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:01,025 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:01,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 15:20:01,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12245#true} {12245#true} #689#return; {12245#true} is VALID [2022-04-28 15:20:01,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {12245#true} call #t~ret161 := main(); {12245#true} is VALID [2022-04-28 15:20:01,025 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:01,025 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:01,025 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:01,028 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:01,028 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:01,029 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:01,030 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:01,030 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:01,030 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:01,031 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:01,031 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:01,032 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:01,032 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:01,032 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:01,032 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:01,032 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:01,033 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:01,033 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:01,033 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:01,033 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:01,033 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:01,033 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:01,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {12246#false} ~skip~0 := 0; {12246#false} is VALID [2022-04-28 15:20:01,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 15:20:01,033 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:01,033 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,034 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:01,035 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:01,035 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:01,035 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:01,035 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:01,035 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:01,035 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:01,035 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:01,036 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:01,036 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:01,036 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:01,036 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:01,036 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:01,036 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:01,036 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:01,036 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:01,036 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:01,037 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:01,037 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:01,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {12246#false} assume 8641 == #t~mem76;havoc #t~mem76; {12246#false} is VALID [2022-04-28 15:20:01,037 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:01,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {12246#false} assume 5 == ~blastFlag~0; {12246#false} is VALID [2022-04-28 15:20:01,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 15:20:01,038 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:01,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506904610] [2022-04-28 15:20:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506904610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:01,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:01,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:01,038 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:01,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [318621959] [2022-04-28 15:20:01,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [318621959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:01,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:01,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:01,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906485502] [2022-04-28 15:20:01,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:01,039 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:01,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:01,040 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:01,094 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:01,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:01,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:01,095 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:04,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:07,266 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:20:09,271 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:11,299 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:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:12,555 INFO L93 Difference]: Finished difference Result 561 states and 896 transitions. [2022-04-28 15:20:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:12,555 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:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:12,555 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:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:20:12,559 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:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:20:12,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:20:13,046 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:13,068 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:13,068 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:13,068 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:13,069 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 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, 8.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:13,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-04-28 15:20:13,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:13,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:13,082 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:13,083 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:13,083 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:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:13,092 INFO L93 Difference]: Finished difference Result 337 states and 526 transitions. [2022-04-28 15:20:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 526 transitions. [2022-04-28 15:20:13,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:13,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:13,093 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:13,094 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:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:13,103 INFO L93 Difference]: Finished difference Result 337 states and 526 transitions. [2022-04-28 15:20:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 526 transitions. [2022-04-28 15:20:13,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:13,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:13,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:13,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:13,105 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:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-28 15:20:13,110 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 63 [2022-04-28 15:20:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:13,110 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-28 15:20:13,111 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:13,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-28 15:20:13,412 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:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-28 15:20:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:13,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:13,413 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:13,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:20:13,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:13,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 1 times [2022-04-28 15:20:13,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:13,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220759979] [2022-04-28 15:20:13,432 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:13,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 2 times [2022-04-28 15:20:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:13,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006110572] [2022-04-28 15:20:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:13,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:13,552 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:13,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {14553#true} assume true; {14553#true} is VALID [2022-04-28 15:20:13,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14553#true} {14553#true} #689#return; {14553#true} is VALID [2022-04-28 15:20:13,554 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:13,554 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:13,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {14553#true} assume true; {14553#true} is VALID [2022-04-28 15:20:13,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14553#true} {14553#true} #689#return; {14553#true} is VALID [2022-04-28 15:20:13,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {14553#true} call #t~ret161 := main(); {14553#true} is VALID [2022-04-28 15:20:13,554 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:13,555 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:13,555 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:13,557 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:13,558 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:13,558 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:13,559 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:13,559 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:13,560 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:13,560 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:13,561 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:13,561 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:13,561 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:13,562 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:13,562 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:13,563 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:13,563 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:13,564 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:13,564 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:13,564 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:13,564 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:13,564 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:13,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {14554#false} ~skip~0 := 0; {14554#false} is VALID [2022-04-28 15:20:13,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {14554#false} assume !false; {14554#false} is VALID [2022-04-28 15:20:13,564 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,565 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,566 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 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:13,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {14554#false} assume 8641 == #t~mem76;havoc #t~mem76; {14554#false} is VALID [2022-04-28 15:20:13,567 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:13,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {14554#false} assume 5 == ~blastFlag~0; {14554#false} is VALID [2022-04-28 15:20:13,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {14554#false} assume !false; {14554#false} is VALID [2022-04-28 15:20:13,568 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:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:13,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006110572] [2022-04-28 15:20:13,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006110572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:13,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:13,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:13,569 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:13,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220759979] [2022-04-28 15:20:13,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220759979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:13,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:13,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707058630] [2022-04-28 15:20:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:13,570 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:13,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:13,570 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:13,623 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:13,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:13,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:13,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:13,625 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:15,649 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,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:16,670 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-28 15:20:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:16,670 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:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:16,671 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:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:20:16,674 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:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:20:16,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:20:17,033 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:17,039 INFO L225 Difference]: With dead ends: 488 [2022-04-28 15:20:17,039 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:20:17,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:20:17,040 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:17,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:20:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:20:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-28 15:20:17,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:17,050 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:17,051 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:17,052 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:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:17,057 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:20:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:20:17,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:17,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:17,059 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:17,060 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:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:17,065 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:20:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:20:17,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:17,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:17,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:17,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:17,067 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:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-28 15:20:17,072 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 63 [2022-04-28 15:20:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:17,072 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-28 15:20:17,072 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:17,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-28 15:20:17,417 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:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-28 15:20:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:20:17,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:17,418 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:17,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:20:17,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 1 times [2022-04-28 15:20:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031157820] [2022-04-28 15:20:17,437 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:17,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:17,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 2 times [2022-04-28 15:20:17,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457533753] [2022-04-28 15:20:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:17,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:17,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:17,598 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:17,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {16569#true} assume true; {16569#true} is VALID [2022-04-28 15:20:17,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16569#true} {16569#true} #689#return; {16569#true} is VALID [2022-04-28 15:20:17,600 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:17,600 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:17,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {16569#true} assume true; {16569#true} is VALID [2022-04-28 15:20:17,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16569#true} {16569#true} #689#return; {16569#true} is VALID [2022-04-28 15:20:17,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {16569#true} call #t~ret161 := main(); {16569#true} is VALID [2022-04-28 15:20:17,600 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:17,601 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:17,602 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:17,604 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:17,604 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:17,605 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:17,606 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:17,606 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:17,606 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:17,607 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:17,607 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:17,608 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:17,608 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:17,608 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:17,609 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:17,609 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:17,610 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:17,610 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:17,610 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:17,611 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:17,611 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:17,611 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:17,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {16570#false} ~skip~0 := 0; {16570#false} is VALID [2022-04-28 15:20:17,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {16570#false} assume !false; {16570#false} is VALID [2022-04-28 15:20:17,611 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:17,611 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:17,611 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:17,611 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:17,611 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:17,612 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:17,612 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:17,614 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:17,614 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:17,615 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:17,615 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:17,615 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:17,617 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:17,618 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:17,618 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:17,618 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:17,618 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:17,618 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:17,618 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:17,618 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:17,618 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:17,619 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:17,620 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:17,620 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:17,620 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:17,620 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:17,620 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:17,620 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:17,620 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:17,620 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:17,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {16570#false} assume 8641 == #t~mem76;havoc #t~mem76; {16570#false} is VALID [2022-04-28 15:20:17,621 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:17,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {16570#false} assume 5 == ~blastFlag~0; {16570#false} is VALID [2022-04-28 15:20:17,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {16570#false} assume !false; {16570#false} is VALID [2022-04-28 15:20:17,621 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:17,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:17,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457533753] [2022-04-28 15:20:17,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457533753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:17,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:17,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:17,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:17,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031157820] [2022-04-28 15:20:17,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031157820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:17,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:17,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:17,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220696676] [2022-04-28 15:20:17,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:17,623 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,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:17,623 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,677 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,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:17,678 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:19,702 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:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:20,611 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-28 15:20:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:20,612 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:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:20,612 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:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:20:20,615 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:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:20:20,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-28 15:20:20,963 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:20,968 INFO L225 Difference]: With dead ends: 487 [2022-04-28 15:20:20,968 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 15:20:20,969 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:20,969 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:20,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:20:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 15:20:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-28 15:20:20,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:20,981 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:20,981 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:20,982 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:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:20,987 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:20:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:20:20,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:20,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:20,988 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:20,988 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:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:20,994 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:20:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:20:20,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:20,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:20,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:20,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:20,995 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:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-28 15:20:21,001 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 63 [2022-04-28 15:20:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:21,001 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-28 15:20:21,001 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:21,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-28 15:20:21,361 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:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-28 15:20:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:20:21,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:21,362 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:21,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:20:21,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 1 times [2022-04-28 15:20:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:21,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146920285] [2022-04-28 15:20:21,382 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:21,382 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 2 times [2022-04-28 15:20:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:21,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875050627] [2022-04-28 15:20:21,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:21,539 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:21,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-28 15:20:21,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18581#true} {18581#true} #689#return; {18581#true} is VALID [2022-04-28 15:20:21,540 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:21,540 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:21,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-28 15:20:21,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18581#true} {18581#true} #689#return; {18581#true} is VALID [2022-04-28 15:20:21,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {18581#true} call #t~ret161 := main(); {18581#true} is VALID [2022-04-28 15:20:21,541 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:21,541 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:21,541 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:21,543 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:21,544 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:21,544 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:21,545 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:21,545 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:21,546 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:21,546 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:21,546 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:21,547 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:21,547 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:21,548 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:21,548 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:21,548 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:21,548 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:21,548 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:21,548 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:21,548 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:21,548 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:21,549 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:21,549 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:21,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {18582#false} ~skip~0 := 0; {18582#false} is VALID [2022-04-28 15:20:21,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-28 15:20:21,549 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:21,549 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:21,549 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:21,549 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:21,549 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:21,549 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:21,549 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:21,550 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:21,550 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:21,550 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:21,550 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:21,550 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:21,550 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:21,550 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:21,550 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,551 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:21,552 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:21,552 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:21,552 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:21,552 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:21,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {18582#false} assume 8641 == #t~mem76;havoc #t~mem76; {18582#false} is VALID [2022-04-28 15:20:21,552 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:21,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {18582#false} assume 5 == ~blastFlag~0; {18582#false} is VALID [2022-04-28 15:20:21,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-28 15:20:21,553 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:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875050627] [2022-04-28 15:20:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875050627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:21,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:21,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:21,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:21,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146920285] [2022-04-28 15:20:21,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146920285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:21,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:21,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026382830] [2022-04-28 15:20:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:21,554 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:21,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:21,554 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:21,609 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:21,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:21,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:21,610 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:20:27,179 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:20:31,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:32,754 INFO L93 Difference]: Finished difference Result 561 states and 887 transitions. [2022-04-28 15:20:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:32,755 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:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:32,755 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:20:32,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:20:32,759 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:20:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:20:32,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 15:20:33,246 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:20:33,254 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:33,254 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:33,255 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:33,256 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 143 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 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, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:33,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 15:20:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:33,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:33,267 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:20:33,267 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:20:33,267 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:20:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:33,281 INFO L93 Difference]: Finished difference Result 337 states and 520 transitions. [2022-04-28 15:20:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 520 transitions. [2022-04-28 15:20:33,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:33,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:33,283 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:20:33,283 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:20:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:33,291 INFO L93 Difference]: Finished difference Result 337 states and 520 transitions. [2022-04-28 15:20:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 520 transitions. [2022-04-28 15:20:33,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:33,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:33,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:33,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:33,292 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:20:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-28 15:20:33,298 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 64 [2022-04-28 15:20:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:33,298 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-28 15:20:33,298 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:20:33,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-28 15:20:33,597 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:20:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-28 15:20:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:20:33,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:33,600 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:20:33,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:20:33,600 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 1 times [2022-04-28 15:20:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:33,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [998683470] [2022-04-28 15:20:33,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:33,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 2 times [2022-04-28 15:20:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:33,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258891758] [2022-04-28 15:20:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:33,743 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:20:33,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {20889#true} assume true; {20889#true} is VALID [2022-04-28 15:20:33,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20889#true} {20889#true} #689#return; {20889#true} is VALID [2022-04-28 15:20:33,745 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:20:33,745 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:20:33,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {20889#true} assume true; {20889#true} is VALID [2022-04-28 15:20:33,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20889#true} {20889#true} #689#return; {20889#true} is VALID [2022-04-28 15:20:33,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {20889#true} call #t~ret161 := main(); {20889#true} is VALID [2022-04-28 15:20:33,745 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:20:33,745 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:20:33,745 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:20:33,748 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:20:33,748 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:20:33,749 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:20:33,749 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:20:33,750 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:20:33,750 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:20:33,751 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:20:33,751 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:20:33,751 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:20:33,752 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:20:33,752 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 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:20:33,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {20890#false} ~skip~0 := 0; {20890#false} is VALID [2022-04-28 15:20:33,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {20890#false} assume !false; {20890#false} is VALID [2022-04-28 15:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,754 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,755 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 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:20:33,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {20890#false} assume 8641 == #t~mem76;havoc #t~mem76; {20890#false} is VALID [2022-04-28 15:20:33,757 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:20:33,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {20890#false} assume 5 == ~blastFlag~0; {20890#false} is VALID [2022-04-28 15:20:33,757 INFO L290 TraceCheckUtils]: 64: Hoare triple {20890#false} assume !false; {20890#false} is VALID [2022-04-28 15:20:33,757 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:20:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:33,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258891758] [2022-04-28 15:20:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258891758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:33,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:33,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:33,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:33,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [998683470] [2022-04-28 15:20:33,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [998683470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:33,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:33,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888936865] [2022-04-28 15:20:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:33,759 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:20:33,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:33,759 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:20:33,809 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:20:33,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:33,810 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:20:40,625 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:42,652 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:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:43,780 INFO L93 Difference]: Finished difference Result 561 states and 880 transitions. [2022-04-28 15:20:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:43,780 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:20:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:43,780 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:20:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:20:43,785 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:20:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-28 15:20:43,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-28 15:20:44,262 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:20:44,269 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:20:44,269 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:20:44,270 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:44,270 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 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, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:44,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 15:20:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:20:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 250. [2022-04-28 15:20:44,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:44,283 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:20:44,283 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:20:44,283 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:20:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:44,290 INFO L93 Difference]: Finished difference Result 337 states and 516 transitions. [2022-04-28 15:20:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 516 transitions. [2022-04-28 15:20:44,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:44,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:44,292 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:20:44,292 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:20:44,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:44,299 INFO L93 Difference]: Finished difference Result 337 states and 516 transitions. [2022-04-28 15:20:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 516 transitions. [2022-04-28 15:20:44,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:44,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:44,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:44,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:44,300 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:20:44,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-28 15:20:44,305 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 65 [2022-04-28 15:20:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:44,306 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-28 15:20:44,306 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:20:44,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-28 15:20:44,596 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:20:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-28 15:20:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:20:44,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:44,597 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:20:44,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:20:44,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:44,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 1 times [2022-04-28 15:20:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:44,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039593556] [2022-04-28 15:20:44,634 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:20:44,634 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 2 times [2022-04-28 15:20:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:44,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466525790] [2022-04-28 15:20:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:44,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:44,749 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:20:44,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {23197#true} assume true; {23197#true} is VALID [2022-04-28 15:20:44,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23197#true} {23197#true} #689#return; {23197#true} is VALID [2022-04-28 15:20:44,750 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:20:44,750 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:20:44,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {23197#true} assume true; {23197#true} is VALID [2022-04-28 15:20:44,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23197#true} {23197#true} #689#return; {23197#true} is VALID [2022-04-28 15:20:44,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {23197#true} call #t~ret161 := main(); {23197#true} is VALID [2022-04-28 15:20:44,751 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:20:44,751 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:20:44,751 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:20:44,753 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:20:44,754 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:20:44,754 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:20:44,755 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:20:44,755 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:20:44,756 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:20:44,756 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:20:44,757 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:20:44,757 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:20:44,760 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:20:44,761 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:20:44,761 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:20:44,761 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 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:20:44,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {23198#false} ~skip~0 := 0; {23198#false} is VALID [2022-04-28 15:20:44,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {23198#false} assume !false; {23198#false} is VALID [2022-04-28 15:20:44,762 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:20:44,762 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,763 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,764 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:20:44,765 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:20:44,765 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:20:44,765 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:20:44,765 INFO L290 TraceCheckUtils]: 62: Hoare triple {23198#false} assume 8641 == #t~mem76;havoc #t~mem76; {23198#false} is VALID [2022-04-28 15:20:44,765 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:20:44,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {23198#false} assume 5 == ~blastFlag~0; {23198#false} is VALID [2022-04-28 15:20:44,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {23198#false} assume !false; {23198#false} is VALID [2022-04-28 15:20:44,765 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:20:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466525790] [2022-04-28 15:20:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466525790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:44,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:44,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039593556] [2022-04-28 15:20:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039593556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:44,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:44,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:44,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552096608] [2022-04-28 15:20:44,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:44,775 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:20:44,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:44,775 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:20:44,832 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:20:44,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:44,833 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:20:48,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:20:53,237 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:20:56,731 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:20:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,578 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-28 15:20:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:20:57,579 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:20:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:20:57,579 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:20:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:20:57,582 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:20:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:20:57,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:20:57,868 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:20:57,873 INFO L225 Difference]: With dead ends: 477 [2022-04-28 15:20:57,873 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:20:57,873 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,874 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:20:57,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:20:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:20:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-28 15:20:57,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:20:57,885 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:20:57,885 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:20:57,886 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:20:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,890 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:20:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:20:57,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:57,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:57,891 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:20:57,892 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:20:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:20:57,896 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:20:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:20:57,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:20:57,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:20:57,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:20:57,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:20:57,898 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:20:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-28 15:20:57,903 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 66 [2022-04-28 15:20:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:20:57,903 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-28 15:20:57,903 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:20:57,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-28 15:20:58,201 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:20:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-28 15:20:58,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:20:58,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:20:58,202 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:20:58,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:20:58,202 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:20:58,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:20:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 1 times [2022-04-28 15:20:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:58,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580184544] [2022-04-28 15:20:58,232 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:20:58,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:20:58,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 2 times [2022-04-28 15:20:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:20:58,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58202241] [2022-04-28 15:20:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:20:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:20:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:20:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:20:58,381 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:20:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 15:20:58,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25169#true} {25169#true} #689#return; {25169#true} is VALID [2022-04-28 15:20:58,382 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:20:58,382 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:20:58,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#true} assume true; {25169#true} is VALID [2022-04-28 15:20:58,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#true} {25169#true} #689#return; {25169#true} is VALID [2022-04-28 15:20:58,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#true} call #t~ret161 := main(); {25169#true} is VALID [2022-04-28 15:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 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:20:58,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {25169#true} assume !false; {25169#true} is VALID [2022-04-28 15:20:58,383 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:20:58,383 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:20:58,384 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:20:58,384 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:20:58,384 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:20:58,384 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:20:58,384 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:20:58,384 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:20:58,384 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:20:58,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {25169#true} assume 8464 == #t~mem55;havoc #t~mem55; {25169#true} is VALID [2022-04-28 15:20:58,384 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:20:58,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {25169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25169#true} is VALID [2022-04-28 15:20:58,385 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:20:58,391 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:20:58,392 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:20:58,392 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:20:58,393 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:20:58,393 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:20:58,394 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:20:58,394 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:20:58,394 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:20:58,395 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:20:58,395 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:20:58,396 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:20:58,396 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:20:58,396 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:20:58,397 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:20:58,397 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:20:58,398 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:20:58,398 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:20:58,398 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:20:58,399 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:20:58,399 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:20:58,400 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:20:58,400 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:20:58,400 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:20:58,401 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:20:58,401 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:20:58,402 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:20:58,402 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:20:58,402 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:20:58,403 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:20:58,403 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:20:58,404 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:20:58,404 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:20:58,404 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:20:58,405 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:20:58,405 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:20:58,405 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:20:58,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {25170#false} assume 5 == ~blastFlag~0; {25170#false} is VALID [2022-04-28 15:20:58,405 INFO L290 TraceCheckUtils]: 65: Hoare triple {25170#false} assume !false; {25170#false} is VALID [2022-04-28 15:20:58,406 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:20:58,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:20:58,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58202241] [2022-04-28 15:20:58,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58202241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:58,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:58,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:58,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:20:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580184544] [2022-04-28 15:20:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580184544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:20:58,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:20:58,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:20:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87097456] [2022-04-28 15:20:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:20:58,412 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:20:58,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:20:58,413 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:20:58,470 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:20:58,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:20:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:20:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:20:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:20:58,471 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:00,490 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:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:01,645 INFO L93 Difference]: Finished difference Result 561 states and 872 transitions. [2022-04-28 15:21:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:01,645 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:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:01,646 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:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:21:01,649 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:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-28 15:21:01,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-28 15:21:02,040 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:02,048 INFO L225 Difference]: With dead ends: 561 [2022-04-28 15:21:02,048 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:21:02,048 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:02,049 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 115 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:02,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 358 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:21:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:21:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 261. [2022-04-28 15:21:02,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:02,062 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:02,062 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:02,063 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:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:02,069 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2022-04-28 15:21:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 514 transitions. [2022-04-28 15:21:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:02,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:02,071 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:02,071 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:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:02,078 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2022-04-28 15:21:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 514 transitions. [2022-04-28 15:21:02,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:02,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:02,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:02,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:02,079 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:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-28 15:21:02,085 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 66 [2022-04-28 15:21:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:02,085 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-28 15:21:02,085 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:02,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-28 15:21:02,389 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:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-28 15:21:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:21:02,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:02,391 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:02,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:21:02,391 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 1 times [2022-04-28 15:21:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:02,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497348890] [2022-04-28 15:21:02,461 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:02,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:02,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 2 times [2022-04-28 15:21:02,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:02,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332851236] [2022-04-28 15:21:02,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:02,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:02,632 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:02,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-28 15:21:02,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27499#true} {27499#true} #689#return; {27499#true} is VALID [2022-04-28 15:21:02,633 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:02,633 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:02,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-28 15:21:02,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #689#return; {27499#true} is VALID [2022-04-28 15:21:02,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret161 := main(); {27499#true} is VALID [2022-04-28 15:21:02,633 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:02,633 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:02,634 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:02,634 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:02,634 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:02,634 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:02,634 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:02,634 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:02,634 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:02,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {27499#true} assume !false; {27499#true} is VALID [2022-04-28 15:21:02,634 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:02,634 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:02,634 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:02,634 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:02,642 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:02,642 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:02,642 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:02,642 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:02,642 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:02,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {27499#true} assume 8464 == #t~mem55;havoc #t~mem55; {27499#true} is VALID [2022-04-28 15:21:02,642 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:02,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27499#true} is VALID [2022-04-28 15:21:02,644 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:02,644 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:02,645 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:02,645 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:02,645 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:02,646 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:02,646 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:02,647 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:02,647 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:02,647 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:02,648 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:02,648 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:02,649 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:02,649 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:02,649 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:02,650 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:02,650 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:02,651 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:02,651 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:02,651 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:02,652 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:02,652 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:02,652 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:02,652 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:02,652 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:02,652 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:02,653 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:02,653 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:02,653 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:02,653 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:02,653 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:02,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {27500#false} ~skip~0 := 0; {27500#false} is VALID [2022-04-28 15:21:02,653 INFO L290 TraceCheckUtils]: 59: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-28 15:21:02,653 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:02,653 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:02,653 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:02,653 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:02,653 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,654 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:02,655 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:02,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {27500#false} assume 8544 == #t~mem64;havoc #t~mem64; {27500#false} is VALID [2022-04-28 15:21:02,655 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:02,655 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:02,655 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:02,655 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:02,655 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:02,655 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:02,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {27500#false} assume 8 == ~blastFlag~0; {27500#false} is VALID [2022-04-28 15:21:02,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-28 15:21:02,656 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:02,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332851236] [2022-04-28 15:21:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332851236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:02,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:02,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:02,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:02,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497348890] [2022-04-28 15:21:02,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497348890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:02,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:02,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:02,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588317586] [2022-04-28 15:21:02,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:02,657 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:02,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:02,657 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:02,731 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:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:02,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:02,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:02,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:02,733 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:05,053 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:21:07,057 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:11,726 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:21:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:12,979 INFO L93 Difference]: Finished difference Result 612 states and 959 transitions. [2022-04-28 15:21:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:12,979 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:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:12,980 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:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:12,983 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:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:12,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:21:13,381 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:13,387 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:21:13,387 INFO L226 Difference]: Without dead ends: 377 [2022-04-28 15:21:13,388 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:13,388 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 128 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:13,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 358 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 15:21:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-04-28 15:21:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 287. [2022-04-28 15:21:13,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:13,406 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:13,406 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:13,407 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:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:13,422 INFO L93 Difference]: Finished difference Result 377 states and 578 transitions. [2022-04-28 15:21:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 578 transitions. [2022-04-28 15:21:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:13,423 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:13,423 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:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:13,431 INFO L93 Difference]: Finished difference Result 377 states and 578 transitions. [2022-04-28 15:21:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 578 transitions. [2022-04-28 15:21:13,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:13,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:13,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:13,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:13,432 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:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-28 15:21:13,438 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-28 15:21:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:13,438 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-28 15:21:13,439 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:13,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-28 15:21:13,854 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:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-28 15:21:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:21:13,855 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:13,855 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:13,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:21:13,856 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 1 times [2022-04-28 15:21:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661919291] [2022-04-28 15:21:13,918 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:13,918 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 2 times [2022-04-28 15:21:13,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964359733] [2022-04-28 15:21:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:14,041 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:14,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:21:14,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30063#true} {30063#true} #689#return; {30063#true} is VALID [2022-04-28 15:21:14,043 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:14,043 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:14,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {30063#true} assume true; {30063#true} is VALID [2022-04-28 15:21:14,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30063#true} {30063#true} #689#return; {30063#true} is VALID [2022-04-28 15:21:14,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {30063#true} call #t~ret161 := main(); {30063#true} is VALID [2022-04-28 15:21:14,043 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:14,043 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:14,043 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:14,043 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:14,043 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:14,044 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:14,044 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:14,044 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:14,044 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:14,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {30063#true} assume !false; {30063#true} is VALID [2022-04-28 15:21:14,044 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:14,044 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:14,044 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:14,044 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:14,044 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:14,044 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:14,044 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:14,044 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:14,045 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:14,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {30063#true} assume 8464 == #t~mem55;havoc #t~mem55; {30063#true} is VALID [2022-04-28 15:21:14,045 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:14,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {30063#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30063#true} is VALID [2022-04-28 15:21:14,046 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:14,046 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:14,047 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:14,047 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:14,048 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:14,048 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:14,048 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:14,049 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:14,049 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:14,050 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:14,050 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:14,051 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:14,051 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:14,051 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:14,052 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:14,052 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:14,053 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:14,053 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:14,054 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:14,054 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:14,054 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:14,055 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:14,055 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:14,055 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:14,055 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:14,055 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:14,055 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:14,056 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:14,056 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:14,056 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:14,056 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:14,056 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:14,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {30064#false} ~skip~0 := 0; {30064#false} is VALID [2022-04-28 15:21:14,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-28 15:21:14,056 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:14,056 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:14,056 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,057 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:14,058 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:14,058 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:14,058 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:14,058 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:14,058 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:14,058 INFO L290 TraceCheckUtils]: 79: Hoare triple {30064#false} assume 8544 == #t~mem64;havoc #t~mem64; {30064#false} is VALID [2022-04-28 15:21:14,058 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:14,058 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:14,058 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:14,058 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:14,058 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:14,059 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:14,059 INFO L290 TraceCheckUtils]: 86: Hoare triple {30064#false} assume 8 == ~blastFlag~0; {30064#false} is VALID [2022-04-28 15:21:14,059 INFO L290 TraceCheckUtils]: 87: Hoare triple {30064#false} assume !false; {30064#false} is VALID [2022-04-28 15:21:14,059 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:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:14,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964359733] [2022-04-28 15:21:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964359733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:14,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:14,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:14,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661919291] [2022-04-28 15:21:14,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661919291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:14,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:14,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770925092] [2022-04-28 15:21:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:14,061 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:14,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:14,061 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:14,130 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:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:14,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:14,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:14,132 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:15,971 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:21:17,975 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:20,004 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:23,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:23,356 INFO L93 Difference]: Finished difference Result 624 states and 972 transitions. [2022-04-28 15:21:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:23,356 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:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:23,357 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:21:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:23,359 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:21:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-28 15:21:23,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-28 15:21:23,753 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:23,759 INFO L225 Difference]: With dead ends: 624 [2022-04-28 15:21:23,759 INFO L226 Difference]: Without dead ends: 363 [2022-04-28 15:21:23,760 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:23,760 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:23,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 498 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:21:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-28 15:21:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 287. [2022-04-28 15:21:23,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:23,776 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:21:23,776 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:21:23,777 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:21:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:23,784 INFO L93 Difference]: Finished difference Result 363 states and 551 transitions. [2022-04-28 15:21:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2022-04-28 15:21:23,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:23,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:23,785 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:21:23,786 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:21:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:23,793 INFO L93 Difference]: Finished difference Result 363 states and 551 transitions. [2022-04-28 15:21:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2022-04-28 15:21:23,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:23,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:23,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:23,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:23,795 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:21:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-28 15:21:23,801 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-28 15:21:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:23,801 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-28 15:21:23,801 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:21:23,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-28 15:21:24,158 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:21:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-28 15:21:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:21:24,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:24,159 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:21:24,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:21:24,160 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 1 times [2022-04-28 15:21:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:24,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498785635] [2022-04-28 15:21:24,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:24,208 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 2 times [2022-04-28 15:21:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:24,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267279489] [2022-04-28 15:21:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:24,332 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:21:24,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {32623#true} assume true; {32623#true} is VALID [2022-04-28 15:21:24,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32623#true} {32623#true} #689#return; {32623#true} is VALID [2022-04-28 15:21:24,333 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:21:24,333 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:21:24,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {32623#true} assume true; {32623#true} is VALID [2022-04-28 15:21:24,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32623#true} {32623#true} #689#return; {32623#true} is VALID [2022-04-28 15:21:24,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {32623#true} call #t~ret161 := main(); {32623#true} is VALID [2022-04-28 15:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 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:21:24,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {32623#true} assume !false; {32623#true} is VALID [2022-04-28 15:21:24,334 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 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:21:24,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {32623#true} assume 8464 == #t~mem55;havoc #t~mem55; {32623#true} is VALID [2022-04-28 15:21:24,335 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:21:24,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {32623#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32623#true} is VALID [2022-04-28 15:21:24,336 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:21:24,337 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:21:24,337 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:21:24,338 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:21:24,338 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:21:24,338 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:21:24,339 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:21:24,339 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:21:24,340 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:21:24,340 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:21:24,340 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:21:24,341 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:21:24,341 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:21:24,342 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:21:24,342 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:21:24,342 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:21:24,343 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:21:24,343 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:21:24,343 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:21:24,343 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:21:24,343 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:21:24,343 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:21:24,343 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:21:24,344 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:21:24,344 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:21:24,344 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:21:24,344 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:21:24,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {32624#false} assume 8448 == #t~mem68;havoc #t~mem68; {32624#false} is VALID [2022-04-28 15:21:24,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {32624#false} assume !(~num1~0 > 0); {32624#false} is VALID [2022-04-28 15:21:24,344 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:21:24,344 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:21:24,344 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:21:24,344 INFO L290 TraceCheckUtils]: 59: Hoare triple {32624#false} ~skip~0 := 0; {32624#false} is VALID [2022-04-28 15:21:24,344 INFO L290 TraceCheckUtils]: 60: Hoare triple {32624#false} assume !false; {32624#false} is VALID [2022-04-28 15:21:24,344 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,345 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {32624#false} assume 8544 == #t~mem64;havoc #t~mem64; {32624#false} is VALID [2022-04-28 15:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,346 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:21:24,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {32624#false} assume 8 == ~blastFlag~0; {32624#false} is VALID [2022-04-28 15:21:24,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {32624#false} assume !false; {32624#false} is VALID [2022-04-28 15:21:24,347 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:21:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:24,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267279489] [2022-04-28 15:21:24,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267279489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:24,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:24,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:24,348 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:24,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498785635] [2022-04-28 15:21:24,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498785635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:24,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:24,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398695785] [2022-04-28 15:21:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:24,349 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:21:24,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:24,349 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:21:24,418 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:21:24,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:24,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:24,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:24,419 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:21:28,939 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:34,074 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:21:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:35,054 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-28 15:21:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:35,054 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:21:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:35,055 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:21:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:21:35,057 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:21:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:21:35,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:21:35,370 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:21:35,375 INFO L225 Difference]: With dead ends: 590 [2022-04-28 15:21:35,375 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:21:35,376 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:35,376 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:35,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:21:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:21:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:21:35,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:35,392 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:21:35,393 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:21:35,393 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:21:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:35,400 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:21:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:21:35,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:35,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:35,402 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:21:35,403 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:21:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:35,408 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:21:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:21:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:35,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:35,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:35,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:35,410 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:21:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-28 15:21:35,417 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-28 15:21:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:35,417 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-28 15:21:35,417 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:21:35,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-28 15:21:35,836 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:21:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-28 15:21:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 15:21:35,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:35,837 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:21:35,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:21:35,837 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 1 times [2022-04-28 15:21:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:35,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948655978] [2022-04-28 15:21:35,889 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:35,889 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 2 times [2022-04-28 15:21:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:35,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566278762] [2022-04-28 15:21:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:36,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:36,036 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:21:36,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {35091#true} assume true; {35091#true} is VALID [2022-04-28 15:21:36,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35091#true} {35091#true} #689#return; {35091#true} is VALID [2022-04-28 15:21:36,037 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:21:36,037 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:21:36,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {35091#true} assume true; {35091#true} is VALID [2022-04-28 15:21:36,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35091#true} {35091#true} #689#return; {35091#true} is VALID [2022-04-28 15:21:36,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {35091#true} call #t~ret161 := main(); {35091#true} is VALID [2022-04-28 15:21:36,037 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:21:36,037 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:21:36,037 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {35091#true} assume !false; {35091#true} is VALID [2022-04-28 15:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,038 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:21:36,039 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:21:36,039 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:21:36,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {35091#true} assume 8464 == #t~mem55;havoc #t~mem55; {35091#true} is VALID [2022-04-28 15:21:36,039 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:21:36,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {35091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35091#true} is VALID [2022-04-28 15:21:36,040 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:21:36,041 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:21:36,041 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:21:36,041 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:21:36,042 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:21:36,042 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:21:36,042 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:21:36,043 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:21:36,043 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:21:36,044 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:21:36,044 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:21:36,044 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:21:36,045 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:21:36,045 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:21:36,045 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:21:36,045 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:21:36,045 INFO L290 TraceCheckUtils]: 43: Hoare triple {35092#false} ~skip~0 := 0; {35092#false} is VALID [2022-04-28 15:21:36,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:21:36,045 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:21:36,045 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:21:36,045 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:21:36,045 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:21:36,045 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,046 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:21:36,047 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:21:36,047 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:21:36,047 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:21:36,047 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:21:36,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {35092#false} assume 8448 == #t~mem68;havoc #t~mem68; {35092#false} is VALID [2022-04-28 15:21:36,047 INFO L290 TraceCheckUtils]: 68: Hoare triple {35092#false} assume !(~num1~0 > 0); {35092#false} is VALID [2022-04-28 15:21:36,047 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:21:36,047 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:21:36,047 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:21:36,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {35092#false} ~skip~0 := 0; {35092#false} is VALID [2022-04-28 15:21:36,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:21:36,047 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,048 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:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 INFO L290 TraceCheckUtils]: 92: Hoare triple {35092#false} assume 8544 == #t~mem64;havoc #t~mem64; {35092#false} is VALID [2022-04-28 15:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 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:21:36,049 INFO L290 TraceCheckUtils]: 99: Hoare triple {35092#false} assume 8 == ~blastFlag~0; {35092#false} is VALID [2022-04-28 15:21:36,049 INFO L290 TraceCheckUtils]: 100: Hoare triple {35092#false} assume !false; {35092#false} is VALID [2022-04-28 15:21:36,050 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:21:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566278762] [2022-04-28 15:21:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566278762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:36,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948655978] [2022-04-28 15:21:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948655978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:36,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313039073] [2022-04-28 15:21:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:36,051 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:21:36,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:36,052 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:21:36,122 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:21:36,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:36,123 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:21:39,671 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:21:41,682 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:21:43,708 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:46,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:21:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:47,728 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-28 15:21:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:47,729 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:21:47,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:47,729 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:21:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:21:47,732 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:21:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:21:47,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 15:21:48,042 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:21:48,047 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:21:48,047 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:21:48,047 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:48,048 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:21:48,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 393 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:21:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:21:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:21:48,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:21:48,064 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:21:48,065 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:21:48,065 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:21:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:48,071 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:21:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:21:48,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:48,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:48,073 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:21:48,073 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:21:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:48,080 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:21:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:21:48,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:21:48,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:21:48,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:21:48,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:21:48,081 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:21:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-28 15:21:48,088 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-28 15:21:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:21:48,088 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-28 15:21:48,089 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:21:48,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-28 15:21:48,469 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:21:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-28 15:21:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:21:48,470 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:21:48,470 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:21:48,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:21:48,470 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:21:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:21:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 1 times [2022-04-28 15:21:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:48,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623673551] [2022-04-28 15:21:48,540 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:21:48,540 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:21:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 2 times [2022-04-28 15:21:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:21:48,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477994313] [2022-04-28 15:21:48,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:21:48,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:21:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:21:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:21:48,689 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:21:48,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {37603#true} assume true; {37603#true} is VALID [2022-04-28 15:21:48,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37603#true} {37603#true} #689#return; {37603#true} is VALID [2022-04-28 15:21:48,691 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:21:48,691 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:21:48,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {37603#true} assume true; {37603#true} is VALID [2022-04-28 15:21:48,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37603#true} {37603#true} #689#return; {37603#true} is VALID [2022-04-28 15:21:48,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {37603#true} call #t~ret161 := main(); {37603#true} is VALID [2022-04-28 15:21:48,691 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:21:48,691 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:21:48,691 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:21:48,691 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:21:48,692 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:21:48,692 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:21:48,692 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:21:48,692 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:21:48,692 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:21:48,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {37603#true} assume !false; {37603#true} is VALID [2022-04-28 15:21:48,692 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:21:48,692 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:21:48,692 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:21:48,692 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:21:48,692 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:21:48,693 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:21:48,693 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:21:48,693 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:21:48,693 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:21:48,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {37603#true} assume 8464 == #t~mem55;havoc #t~mem55; {37603#true} is VALID [2022-04-28 15:21:48,693 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:21:48,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {37603#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37603#true} is VALID [2022-04-28 15:21:48,694 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:21:48,695 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:21:48,695 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:21:48,695 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:21:48,696 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:21:48,696 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:21:48,697 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:21:48,697 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:21:48,697 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:21:48,698 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:21:48,698 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:21:48,699 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:21:48,699 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:21:48,699 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:21:48,699 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:21:48,699 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:21:48,699 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:21:48,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {37604#false} ~skip~0 := 0; {37604#false} is VALID [2022-04-28 15:21:48,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,700 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 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:21:48,701 INFO L290 TraceCheckUtils]: 68: Hoare triple {37604#false} assume 8448 == #t~mem68;havoc #t~mem68; {37604#false} is VALID [2022-04-28 15:21:48,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {37604#false} assume !(~num1~0 > 0); {37604#false} is VALID [2022-04-28 15:21:48,702 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:21:48,702 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:21:48,702 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:21:48,702 INFO L290 TraceCheckUtils]: 73: Hoare triple {37604#false} ~skip~0 := 0; {37604#false} is VALID [2022-04-28 15:21:48,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:21:48,702 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:21:48,702 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:21:48,702 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:21:48,702 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:21:48,702 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:21:48,702 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,703 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:21:48,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {37604#false} assume 8544 == #t~mem64;havoc #t~mem64; {37604#false} is VALID [2022-04-28 15:21:48,704 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:21:48,704 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:21:48,704 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:21:48,704 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:21:48,704 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:21:48,704 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:21:48,704 INFO L290 TraceCheckUtils]: 100: Hoare triple {37604#false} assume 8 == ~blastFlag~0; {37604#false} is VALID [2022-04-28 15:21:48,704 INFO L290 TraceCheckUtils]: 101: Hoare triple {37604#false} assume !false; {37604#false} is VALID [2022-04-28 15:21:48,705 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:21:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:21:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477994313] [2022-04-28 15:21:48,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477994313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:48,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:48,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:48,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:21:48,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623673551] [2022-04-28 15:21:48,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623673551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:21:48,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:21:48,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:21:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244587085] [2022-04-28 15:21:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:21:48,707 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:21:48,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:21:48,707 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:21:48,772 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:21:48,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:21:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:21:48,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:21:48,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:21:48,774 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:21:52,416 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:54,421 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:56,451 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:58,476 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:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:21:59,753 INFO L93 Difference]: Finished difference Result 668 states and 1032 transitions. [2022-04-28 15:21:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:21:59,753 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:21:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:21:59,754 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:21:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:21:59,756 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:21:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-04-28 15:21:59,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 585 transitions. [2022-04-28 15:22:00,151 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:00,158 INFO L225 Difference]: With dead ends: 668 [2022-04-28 15:22:00,158 INFO L226 Difference]: Without dead ends: 385 [2022-04-28 15:22:00,159 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:00,159 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 136 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 57 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:00,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 497 Invalid, 3 Unknown, 0 Unchecked, 8.1s Time] [2022-04-28 15:22:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-04-28 15:22:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 309. [2022-04-28 15:22:00,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:00,185 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:00,185 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:00,186 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:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:00,194 INFO L93 Difference]: Finished difference Result 385 states and 579 transitions. [2022-04-28 15:22:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 579 transitions. [2022-04-28 15:22:00,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:00,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:00,196 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:00,196 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:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:00,205 INFO L93 Difference]: Finished difference Result 385 states and 579 transitions. [2022-04-28 15:22:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 579 transitions. [2022-04-28 15:22:00,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:00,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:00,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:00,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:00,206 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:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-28 15:22:00,213 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-28 15:22:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:00,213 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-28 15:22:00,213 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:00,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-28 15:22:00,623 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:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-28 15:22:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:22:00,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:00,624 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:00,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:22:00,625 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 1 times [2022-04-28 15:22:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:00,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679714834] [2022-04-28 15:22:00,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:00,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 2 times [2022-04-28 15:22:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:00,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114165398] [2022-04-28 15:22:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:00,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:00,809 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:00,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {40339#true} assume true; {40339#true} is VALID [2022-04-28 15:22:00,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40339#true} {40339#true} #689#return; {40339#true} is VALID [2022-04-28 15:22:00,810 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:00,810 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:00,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {40339#true} assume true; {40339#true} is VALID [2022-04-28 15:22:00,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40339#true} {40339#true} #689#return; {40339#true} is VALID [2022-04-28 15:22:00,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {40339#true} call #t~ret161 := main(); {40339#true} is VALID [2022-04-28 15:22:00,810 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:00,811 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:00,811 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:00,811 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:00,811 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:00,811 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:00,811 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:00,811 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:00,811 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:00,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {40339#true} assume !false; {40339#true} is VALID [2022-04-28 15:22:00,811 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:00,811 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:00,811 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:00,812 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:00,812 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:00,812 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:00,812 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:00,812 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:00,812 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:00,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {40339#true} assume 8464 == #t~mem55;havoc #t~mem55; {40339#true} is VALID [2022-04-28 15:22:00,812 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:00,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {40339#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40339#true} is VALID [2022-04-28 15:22:00,813 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:00,814 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:00,814 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:00,814 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:00,815 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:00,815 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:00,816 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:00,816 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:00,817 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:00,817 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:00,817 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:00,818 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:00,818 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:00,818 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:00,819 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:00,819 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:00,819 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:00,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {40340#false} ~skip~0 := 0; {40340#false} is VALID [2022-04-28 15:22:00,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:00,819 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:00,819 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:00,819 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:00,819 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:00,819 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:00,819 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:00,819 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,820 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:00,821 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:00,821 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:00,821 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:00,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {40340#false} assume 8448 == #t~mem68;havoc #t~mem68; {40340#false} is VALID [2022-04-28 15:22:00,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {40340#false} assume !(~num1~0 > 0); {40340#false} is VALID [2022-04-28 15:22:00,821 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:00,821 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:00,821 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:00,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {40340#false} ~skip~0 := 0; {40340#false} is VALID [2022-04-28 15:22:00,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:00,821 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:00,821 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:00,821 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,822 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:00,834 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:00,834 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:00,834 INFO L290 TraceCheckUtils]: 93: Hoare triple {40340#false} assume 8544 == #t~mem64;havoc #t~mem64; {40340#false} is VALID [2022-04-28 15:22:00,834 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:00,834 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:00,834 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:00,834 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:00,835 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:00,835 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:00,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {40340#false} assume 8 == ~blastFlag~0; {40340#false} is VALID [2022-04-28 15:22:00,835 INFO L290 TraceCheckUtils]: 101: Hoare triple {40340#false} assume !false; {40340#false} is VALID [2022-04-28 15:22:00,835 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:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:00,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114165398] [2022-04-28 15:22:00,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114165398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:00,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:00,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679714834] [2022-04-28 15:22:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679714834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:00,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388694732] [2022-04-28 15:22:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:00,837 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:00,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:00,837 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:00,905 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:00,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:00,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:00,906 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:02,932 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:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:03,929 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-28 15:22:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:03,929 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:03,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:03,929 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:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:22:03,931 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:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:22:03,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:22:04,246 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:04,250 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:22:04,251 INFO L226 Difference]: Without dead ends: 326 [2022-04-28 15:22:04,251 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:04,252 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:04,252 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:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-28 15:22:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-28 15:22:04,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:04,269 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:04,269 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:04,270 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:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:04,276 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:22:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:22:04,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:04,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:04,277 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:04,277 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:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:04,283 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:22:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:22:04,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:04,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:04,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:04,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:04,285 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:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-28 15:22:04,292 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-28 15:22:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:04,292 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-28 15:22:04,292 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:04,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-28 15:22:04,679 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:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-28 15:22:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 15:22:04,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:04,680 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:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:22:04,680 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 1 times [2022-04-28 15:22:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:04,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767200920] [2022-04-28 15:22:04,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:04,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 2 times [2022-04-28 15:22:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:04,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72903757] [2022-04-28 15:22:04,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:04,880 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:04,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {42839#true} assume true; {42839#true} is VALID [2022-04-28 15:22:04,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42839#true} {42839#true} #689#return; {42839#true} is VALID [2022-04-28 15:22:04,881 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:04,881 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:04,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {42839#true} assume true; {42839#true} is VALID [2022-04-28 15:22:04,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42839#true} {42839#true} #689#return; {42839#true} is VALID [2022-04-28 15:22:04,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {42839#true} call #t~ret161 := main(); {42839#true} is VALID [2022-04-28 15:22:04,882 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:04,882 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:04,882 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:04,882 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:04,882 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:04,882 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:04,882 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:04,882 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:04,882 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:04,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {42839#true} assume !false; {42839#true} is VALID [2022-04-28 15:22:04,883 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:04,883 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:04,883 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:04,883 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:04,883 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:04,883 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:04,883 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:04,883 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:04,883 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:04,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {42839#true} assume 8464 == #t~mem55;havoc #t~mem55; {42839#true} is VALID [2022-04-28 15:22:04,884 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:04,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {42839#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42839#true} is VALID [2022-04-28 15:22:04,884 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:04,884 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:04,884 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:04,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {42839#true} ~skip~0 := 0; {42839#true} is VALID [2022-04-28 15:22:04,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {42839#true} assume !false; {42839#true} is VALID [2022-04-28 15:22:04,884 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:04,884 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:04,884 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:04,884 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:04,884 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:04,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {42839#true} assume 8195 == #t~mem51;havoc #t~mem51; {42839#true} is VALID [2022-04-28 15:22:04,885 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:04,885 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:04,885 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:04,885 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:04,885 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:04,885 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:04,886 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:04,887 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:04,887 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:04,888 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:04,888 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:04,889 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:04,889 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:04,889 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:04,890 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:04,890 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:04,891 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:04,891 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:04,891 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:04,891 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:04,891 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:04,891 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:04,891 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 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:04,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {42840#false} assume 8448 == #t~mem68;havoc #t~mem68; {42840#false} is VALID [2022-04-28 15:22:04,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {42840#false} assume !(~num1~0 > 0); {42840#false} is VALID [2022-04-28 15:22:04,892 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:04,893 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:04,893 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:04,893 INFO L290 TraceCheckUtils]: 76: Hoare triple {42840#false} ~skip~0 := 0; {42840#false} is VALID [2022-04-28 15:22:04,893 INFO L290 TraceCheckUtils]: 77: Hoare triple {42840#false} assume !false; {42840#false} is VALID [2022-04-28 15:22:04,893 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:04,893 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:04,893 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:04,893 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:04,893 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:04,893 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:04,893 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:04,893 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:04,893 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 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:04,894 INFO L290 TraceCheckUtils]: 96: Hoare triple {42840#false} assume 8544 == #t~mem64;havoc #t~mem64; {42840#false} is VALID [2022-04-28 15:22:04,894 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:04,894 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:04,895 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:04,895 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:04,895 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:04,895 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:04,895 INFO L290 TraceCheckUtils]: 103: Hoare triple {42840#false} assume 8 == ~blastFlag~0; {42840#false} is VALID [2022-04-28 15:22:04,895 INFO L290 TraceCheckUtils]: 104: Hoare triple {42840#false} assume !false; {42840#false} is VALID [2022-04-28 15:22:04,895 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:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:04,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72903757] [2022-04-28 15:22:04,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72903757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:04,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:04,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:04,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:04,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767200920] [2022-04-28 15:22:04,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767200920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:04,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:04,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962547604] [2022-04-28 15:22:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:04,897 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:04,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:04,897 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:04,979 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:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:04,980 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:13,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:17,721 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-28 15:22:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:17,721 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:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:17,721 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:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:22:17,723 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:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:22:17,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:22:18,013 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:18,018 INFO L225 Difference]: With dead ends: 620 [2022-04-28 15:22:18,018 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:22:18,019 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:18,019 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:18,019 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:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:22:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 15:22:18,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:18,038 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:18,038 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:18,039 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:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:18,045 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:22:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:22:18,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:18,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:18,046 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:18,046 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:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:18,053 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:22:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:22:18,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:18,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:18,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:18,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:18,054 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:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-28 15:22:18,061 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-28 15:22:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:18,062 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-28 15:22:18,062 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:18,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-28 15:22:18,467 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:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-28 15:22:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 15:22:18,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:18,468 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:18,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:22:18,469 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:18,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:18,469 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 1 times [2022-04-28 15:22:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:18,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509727417] [2022-04-28 15:22:18,546 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:18,546 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 2 times [2022-04-28 15:22:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:18,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78421185] [2022-04-28 15:22:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:18,672 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:18,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {45415#true} assume true; {45415#true} is VALID [2022-04-28 15:22:18,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45415#true} {45415#true} #689#return; {45415#true} is VALID [2022-04-28 15:22:18,673 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:18,673 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:18,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {45415#true} assume true; {45415#true} is VALID [2022-04-28 15:22:18,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45415#true} {45415#true} #689#return; {45415#true} is VALID [2022-04-28 15:22:18,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {45415#true} call #t~ret161 := main(); {45415#true} is VALID [2022-04-28 15:22:18,673 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:18,673 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:18,673 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:18,674 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:18,674 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:18,674 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:18,674 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:18,674 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:18,674 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:18,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {45415#true} assume !false; {45415#true} is VALID [2022-04-28 15:22:18,674 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:18,674 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:18,674 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:18,674 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:18,674 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:18,675 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:18,675 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:18,675 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:18,675 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:18,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {45415#true} assume 8464 == #t~mem55;havoc #t~mem55; {45415#true} is VALID [2022-04-28 15:22:18,675 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:18,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {45415#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45415#true} is VALID [2022-04-28 15:22:18,676 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:18,677 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:18,677 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:18,677 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:18,678 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:18,678 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:18,678 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:18,679 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:18,679 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:18,680 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:18,680 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:18,680 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:18,680 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:18,680 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:18,680 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:18,680 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:18,680 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:18,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {45416#false} assume 12292 != #t~mem85;havoc #t~mem85; {45416#false} is VALID [2022-04-28 15:22:18,681 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:18,681 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:18,681 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:18,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {45416#false} ~skip~0 := 0; {45416#false} is VALID [2022-04-28 15:22:18,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:18,681 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:18,681 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:18,681 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:18,681 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:18,681 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:18,681 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,682 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:18,683 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:18,683 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:18,683 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:18,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {45416#false} assume 8448 == #t~mem68;havoc #t~mem68; {45416#false} is VALID [2022-04-28 15:22:18,683 INFO L290 TraceCheckUtils]: 73: Hoare triple {45416#false} assume !(~num1~0 > 0); {45416#false} is VALID [2022-04-28 15:22:18,683 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:18,683 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:18,683 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:18,683 INFO L290 TraceCheckUtils]: 77: Hoare triple {45416#false} ~skip~0 := 0; {45416#false} is VALID [2022-04-28 15:22:18,683 INFO L290 TraceCheckUtils]: 78: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:18,683 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:18,683 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,684 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:18,685 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:18,685 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:18,685 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:18,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {45416#false} assume 8544 == #t~mem64;havoc #t~mem64; {45416#false} is VALID [2022-04-28 15:22:18,685 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:18,685 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:18,685 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:18,685 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:18,685 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:18,685 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:18,685 INFO L290 TraceCheckUtils]: 104: Hoare triple {45416#false} assume 8 == ~blastFlag~0; {45416#false} is VALID [2022-04-28 15:22:18,685 INFO L290 TraceCheckUtils]: 105: Hoare triple {45416#false} assume !false; {45416#false} is VALID [2022-04-28 15:22:18,686 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:18,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:18,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78421185] [2022-04-28 15:22:18,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78421185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:18,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:18,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:18,687 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:18,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509727417] [2022-04-28 15:22:18,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509727417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:18,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:18,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:18,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589381410] [2022-04-28 15:22:18,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:18,687 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:18,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:18,688 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:18,753 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:18,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:18,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:18,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:18,754 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:20,550 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:22:23,925 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:22:25,931 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:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:27,137 INFO L93 Difference]: Finished difference Result 690 states and 1051 transitions. [2022-04-28 15:22:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:27,137 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:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:27,138 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:22:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:22:27,140 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:22:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:22:27,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-28 15:22:27,519 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:22:27,525 INFO L225 Difference]: With dead ends: 690 [2022-04-28 15:22:27,525 INFO L226 Difference]: Without dead ends: 391 [2022-04-28 15:22:27,526 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:27,526 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 130 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s 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, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:27,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 408 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 15:22:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-28 15:22:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 325. [2022-04-28 15:22:27,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:27,546 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:22:27,546 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:22:27,546 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:22:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:27,555 INFO L93 Difference]: Finished difference Result 391 states and 581 transitions. [2022-04-28 15:22:27,555 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 581 transitions. [2022-04-28 15:22:27,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:27,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:27,556 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:22:27,557 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:22:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:27,565 INFO L93 Difference]: Finished difference Result 391 states and 581 transitions. [2022-04-28 15:22:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 581 transitions. [2022-04-28 15:22:27,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:27,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:27,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:27,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:27,567 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:22:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-28 15:22:27,574 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-28 15:22:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:27,574 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-28 15:22:27,574 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:22:27,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-28 15:22:27,999 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:22:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-28 15:22:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 15:22:28,000 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:28,000 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:22:28,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:22:28,000 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:28,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 1 times [2022-04-28 15:22:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [565526006] [2022-04-28 15:22:28,072 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:28,072 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 2 times [2022-04-28 15:22:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:28,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903586537] [2022-04-28 15:22:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:28,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:28,205 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:22:28,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {48239#true} assume true; {48239#true} is VALID [2022-04-28 15:22:28,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48239#true} {48239#true} #689#return; {48239#true} is VALID [2022-04-28 15:22:28,206 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:22:28,207 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:22:28,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {48239#true} assume true; {48239#true} is VALID [2022-04-28 15:22:28,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48239#true} {48239#true} #689#return; {48239#true} is VALID [2022-04-28 15:22:28,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {48239#true} call #t~ret161 := main(); {48239#true} is VALID [2022-04-28 15:22:28,207 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:22:28,207 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:22:28,207 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:22:28,207 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:22:28,207 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:22:28,207 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {48239#true} assume !false; {48239#true} is VALID [2022-04-28 15:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,208 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:22:28,209 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:22:28,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {48239#true} assume 8464 == #t~mem55;havoc #t~mem55; {48239#true} is VALID [2022-04-28 15:22:28,209 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:22:28,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {48239#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48239#true} is VALID [2022-04-28 15:22:28,209 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:22:28,209 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:22:28,209 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:22:28,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {48239#true} ~skip~0 := 0; {48239#true} is VALID [2022-04-28 15:22:28,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {48239#true} assume !false; {48239#true} is VALID [2022-04-28 15:22:28,209 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:22:28,209 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:22:28,209 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 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:22:28,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {48239#true} assume 8496 == #t~mem58;havoc #t~mem58; {48239#true} is VALID [2022-04-28 15:22:28,210 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:22:28,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {48239#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48239#true} is VALID [2022-04-28 15:22:28,211 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:22:28,212 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:22:28,213 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:22:28,214 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:22:28,214 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:22:28,214 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:22:28,215 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:22:28,215 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:22:28,216 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:22:28,216 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:22:28,216 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:22:28,217 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:22:28,217 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:22:28,218 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:22:28,218 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:22:28,218 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:22:28,219 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:22:28,219 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:22:28,220 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:22:28,220 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:22:28,220 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:22:28,221 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:22:28,221 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:22:28,222 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:22:28,222 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:22:28,222 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:22:28,223 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:22:28,223 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:22:28,224 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:22:28,224 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:22:28,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {48240#false} assume !(~num1~0 > 0); {48240#false} is VALID [2022-04-28 15:22:28,224 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:22:28,224 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:22:28,224 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:22:28,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {48240#false} ~skip~0 := 0; {48240#false} is VALID [2022-04-28 15:22:28,224 INFO L290 TraceCheckUtils]: 82: Hoare triple {48240#false} assume !false; {48240#false} is VALID [2022-04-28 15:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,225 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 INFO L290 TraceCheckUtils]: 101: Hoare triple {48240#false} assume 8544 == #t~mem64;havoc #t~mem64; {48240#false} is VALID [2022-04-28 15:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,226 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:22:28,227 INFO L290 TraceCheckUtils]: 108: Hoare triple {48240#false} assume 8 == ~blastFlag~0; {48240#false} is VALID [2022-04-28 15:22:28,227 INFO L290 TraceCheckUtils]: 109: Hoare triple {48240#false} assume !false; {48240#false} is VALID [2022-04-28 15:22:28,227 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:22:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:28,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903586537] [2022-04-28 15:22:28,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903586537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:28,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:28,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:28,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:28,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [565526006] [2022-04-28 15:22:28,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [565526006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:28,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:28,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173026276] [2022-04-28 15:22:28,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:28,229 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:22:28,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:28,229 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:22:28,308 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:22:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:28,309 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:22:31,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:36,917 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:38,942 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:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:40,150 INFO L93 Difference]: Finished difference Result 766 states and 1161 transitions. [2022-04-28 15:22:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:40,150 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:22:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:40,150 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:22:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:22:40,153 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:22:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:22:40,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:22:40,525 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:22:40,534 INFO L225 Difference]: With dead ends: 766 [2022-04-28 15:22:40,534 INFO L226 Difference]: Without dead ends: 467 [2022-04-28 15:22:40,535 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:22:40,535 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 111 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s 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, 7.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:40,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-28 15:22:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-04-28 15:22:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 389. [2022-04-28 15:22:40,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:40,562 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:22:40,563 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:22:40,563 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:22:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:40,574 INFO L93 Difference]: Finished difference Result 467 states and 701 transitions. [2022-04-28 15:22:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 701 transitions. [2022-04-28 15:22:40,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:40,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:40,576 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:22:40,576 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:22:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:40,587 INFO L93 Difference]: Finished difference Result 467 states and 701 transitions. [2022-04-28 15:22:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 701 transitions. [2022-04-28 15:22:40,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:40,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:40,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:40,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:40,589 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:22:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-28 15:22:40,599 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-28 15:22:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:40,599 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-28 15:22:40,599 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:22:40,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-28 15:22:41,210 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:22:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-28 15:22:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 15:22:41,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:41,212 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:22:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:22:41,212 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:41,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 1 times [2022-04-28 15:22:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571949873] [2022-04-28 15:22:41,293 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:41,293 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 2 times [2022-04-28 15:22:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289670280] [2022-04-28 15:22:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:41,439 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:22:41,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {51495#true} assume true; {51495#true} is VALID [2022-04-28 15:22:41,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51495#true} {51495#true} #689#return; {51495#true} is VALID [2022-04-28 15:22:41,440 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:22:41,440 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:22:41,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {51495#true} assume true; {51495#true} is VALID [2022-04-28 15:22:41,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51495#true} {51495#true} #689#return; {51495#true} is VALID [2022-04-28 15:22:41,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {51495#true} call #t~ret161 := main(); {51495#true} is VALID [2022-04-28 15:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 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:22:41,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {51495#true} assume !false; {51495#true} is VALID [2022-04-28 15:22:41,441 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:22:41,441 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:22:41,442 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:22:41,442 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:22:41,442 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:22:41,442 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:22:41,442 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:22:41,442 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:22:41,442 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:22:41,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {51495#true} assume 8464 == #t~mem55;havoc #t~mem55; {51495#true} is VALID [2022-04-28 15:22:41,442 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:22:41,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {51495#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51495#true} is VALID [2022-04-28 15:22:41,442 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:22:41,442 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:22:41,442 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:22:41,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {51495#true} ~skip~0 := 0; {51495#true} is VALID [2022-04-28 15:22:41,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {51495#true} assume !false; {51495#true} is VALID [2022-04-28 15:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,443 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:22:41,444 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:22:41,444 INFO L290 TraceCheckUtils]: 44: Hoare triple {51495#true} assume 8496 == #t~mem58;havoc #t~mem58; {51495#true} is VALID [2022-04-28 15:22:41,444 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:22:41,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {51495#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51495#true} is VALID [2022-04-28 15:22:41,444 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:22:41,445 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:22:41,445 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:22:41,446 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:22:41,446 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:22:41,446 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:22:41,447 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:22:41,447 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:22:41,448 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:22:41,448 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:22:41,448 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:22:41,449 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:22:41,449 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:22:41,450 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:22:41,450 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:22:41,450 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:22:41,451 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:22:41,451 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:22:41,451 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:22:41,452 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:22:41,452 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:22:41,453 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:22:41,453 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:22:41,453 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:22:41,454 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:22:41,454 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:22:41,455 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:22:41,455 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:22:41,455 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:22:41,456 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:22:41,456 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:22:41,457 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:22:41,457 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:22:41,457 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:22:41,458 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:22:41,458 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:22:41,458 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:22:41,458 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:22:41,458 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:22:41,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {51496#false} ~skip~0 := 0; {51496#false} is VALID [2022-04-28 15:22:41,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {51496#false} assume !false; {51496#false} is VALID [2022-04-28 15:22:41,458 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:22:41,458 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:22:41,458 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,459 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 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:22:41,460 INFO L290 TraceCheckUtils]: 117: Hoare triple {51496#false} assume 8640 == #t~mem75;havoc #t~mem75; {51496#false} is VALID [2022-04-28 15:22:41,461 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:22:41,461 INFO L290 TraceCheckUtils]: 119: Hoare triple {51496#false} assume 5 == ~blastFlag~0; {51496#false} is VALID [2022-04-28 15:22:41,461 INFO L290 TraceCheckUtils]: 120: Hoare triple {51496#false} assume !false; {51496#false} is VALID [2022-04-28 15:22:41,461 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:22:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:41,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289670280] [2022-04-28 15:22:41,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289670280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:41,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:41,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:41,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:41,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571949873] [2022-04-28 15:22:41,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571949873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:41,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:41,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318447849] [2022-04-28 15:22:41,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:41,463 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:22:41,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:41,463 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:22:41,546 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:22:41,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:41,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:41,547 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:22:46,342 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:48,370 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:51,550 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:22:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:52,733 INFO L93 Difference]: Finished difference Result 858 states and 1293 transitions. [2022-04-28 15:22:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:22:52,734 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:22:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:22:52,734 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:22:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:22:52,736 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:22:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:22:52,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:22:53,117 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:22:53,127 INFO L225 Difference]: With dead ends: 858 [2022-04-28 15:22:53,127 INFO L226 Difference]: Without dead ends: 495 [2022-04-28 15:22:53,128 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:22:53,128 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 107 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:22:53,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 392 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 477 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 15:22:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-04-28 15:22:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 426. [2022-04-28 15:22:53,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:22:53,159 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:22:53,159 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:22:53,160 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:22:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:53,170 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2022-04-28 15:22:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-04-28 15:22:53,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:53,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:53,172 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:22:53,173 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:22:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:22:53,185 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2022-04-28 15:22:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 737 transitions. [2022-04-28 15:22:53,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:22:53,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:22:53,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:22:53,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:22:53,186 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:22:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-28 15:22:53,206 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 121 [2022-04-28 15:22:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:22:53,206 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-28 15:22:53,206 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:22:53,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-28 15:22:53,905 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:22:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-28 15:22:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:22:53,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:22:53,907 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:22:53,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:22:53,907 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:22:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:22:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 1 times [2022-04-28 15:22:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935292761] [2022-04-28 15:22:53,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:22:53,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:22:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 2 times [2022-04-28 15:22:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:22:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406992580] [2022-04-28 15:22:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:22:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:22:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:22:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:22:54,137 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:22:54,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {55065#true} assume true; {55065#true} is VALID [2022-04-28 15:22:54,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55065#true} {55065#true} #689#return; {55065#true} is VALID [2022-04-28 15:22:54,138 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:22:54,138 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:22:54,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {55065#true} assume true; {55065#true} is VALID [2022-04-28 15:22:54,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55065#true} {55065#true} #689#return; {55065#true} is VALID [2022-04-28 15:22:54,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {55065#true} call #t~ret161 := main(); {55065#true} is VALID [2022-04-28 15:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 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:22:54,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {55065#true} assume !false; {55065#true} is VALID [2022-04-28 15:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 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:22:54,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {55065#true} assume 8464 == #t~mem55;havoc #t~mem55; {55065#true} is VALID [2022-04-28 15:22:54,140 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:22:54,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {55065#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55065#true} is VALID [2022-04-28 15:22:54,140 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:22:54,141 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:22:54,141 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:22:54,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {55065#true} ~skip~0 := 0; {55065#true} is VALID [2022-04-28 15:22:54,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {55065#true} assume !false; {55065#true} is VALID [2022-04-28 15:22:54,141 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:22:54,141 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:22:54,141 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:22:54,141 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:22:54,141 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:22:54,141 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:22:54,141 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:22:54,141 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:22:54,142 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:22:54,142 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:22:54,142 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:22:54,142 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:22:54,142 INFO L290 TraceCheckUtils]: 44: Hoare triple {55065#true} assume 8496 == #t~mem58;havoc #t~mem58; {55065#true} is VALID [2022-04-28 15:22:54,142 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:22:54,142 INFO L290 TraceCheckUtils]: 46: Hoare triple {55065#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55065#true} is VALID [2022-04-28 15:22:54,142 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:22:54,143 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:22:54,144 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:22:54,144 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:22:54,145 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:22:54,145 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:22:54,145 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:22:54,146 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:22:54,146 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:22:54,146 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:22:54,147 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:22:54,147 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:22:54,148 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:22:54,148 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:22:54,148 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:22:54,149 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:22:54,149 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:22:54,150 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:22:54,150 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:22:54,150 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:22:54,151 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:22:54,151 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:22:54,152 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:22:54,152 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:22:54,152 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:22:54,153 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:22:54,153 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:22:54,154 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:22:54,154 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:22:54,154 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:22:54,155 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:22:54,155 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:22:54,156 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:22:54,156 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:22:54,156 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:22:54,157 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:22:54,157 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:22:54,157 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:22:54,157 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:22:54,157 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:22:54,157 INFO L290 TraceCheckUtils]: 87: Hoare triple {55066#false} ~skip~0 := 0; {55066#false} is VALID [2022-04-28 15:22:54,157 INFO L290 TraceCheckUtils]: 88: Hoare triple {55066#false} assume !false; {55066#false} is VALID [2022-04-28 15:22:54,157 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:22:54,157 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,158 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,159 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:22:54,160 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:22:54,160 INFO L290 TraceCheckUtils]: 118: Hoare triple {55066#false} assume 8640 == #t~mem75;havoc #t~mem75; {55066#false} is VALID [2022-04-28 15:22:54,160 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:22:54,160 INFO L290 TraceCheckUtils]: 120: Hoare triple {55066#false} assume 5 == ~blastFlag~0; {55066#false} is VALID [2022-04-28 15:22:54,160 INFO L290 TraceCheckUtils]: 121: Hoare triple {55066#false} assume !false; {55066#false} is VALID [2022-04-28 15:22:54,160 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:22:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:22:54,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406992580] [2022-04-28 15:22:54,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406992580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:54,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:54,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:54,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:22:54,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935292761] [2022-04-28 15:22:54,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935292761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:22:54,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:22:54,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:22:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350609429] [2022-04-28 15:22:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:22:54,163 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:22:54,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:22:54,164 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:22:54,257 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:22:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:22:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:22:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:22:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:22:54,258 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:22:56,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:22:58,806 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:00,830 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:23:02,853 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:23:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:04,080 INFO L93 Difference]: Finished difference Result 892 states and 1343 transitions. [2022-04-28 15:23:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:04,080 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:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:04,080 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:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:04,082 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:04,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:23:04,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:23:04,471 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:04,481 INFO L225 Difference]: With dead ends: 892 [2022-04-28 15:23:04,481 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 15:23:04,482 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:04,482 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:04,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 408 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 483 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-04-28 15:23:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 15:23:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-28 15:23:04,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:04,513 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:04,514 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:04,514 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:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:04,526 INFO L93 Difference]: Finished difference Result 492 states and 731 transitions. [2022-04-28 15:23:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2022-04-28 15:23:04,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:04,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:04,527 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:04,528 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:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:04,537 INFO L93 Difference]: Finished difference Result 492 states and 731 transitions. [2022-04-28 15:23:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 731 transitions. [2022-04-28 15:23:04,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:04,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:04,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:04,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:04,538 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:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 638 transitions. [2022-04-28 15:23:04,550 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 638 transitions. Word has length 122 [2022-04-28 15:23:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:04,551 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 638 transitions. [2022-04-28 15:23:04,551 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:04,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 638 transitions. [2022-04-28 15:23:05,125 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:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 638 transitions. [2022-04-28 15:23:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:23:05,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:05,126 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:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:23:05,126 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:05,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 1 times [2022-04-28 15:23:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:05,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1992492974] [2022-04-28 15:23:05,212 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:05,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:05,213 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 2 times [2022-04-28 15:23:05,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:05,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431123041] [2022-04-28 15:23:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:05,345 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:05,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {58697#true} assume true; {58697#true} is VALID [2022-04-28 15:23:05,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58697#true} {58697#true} #689#return; {58697#true} is VALID [2022-04-28 15:23:05,346 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:05,347 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:05,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {58697#true} assume true; {58697#true} is VALID [2022-04-28 15:23:05,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58697#true} {58697#true} #689#return; {58697#true} is VALID [2022-04-28 15:23:05,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {58697#true} call #t~ret161 := main(); {58697#true} is VALID [2022-04-28 15:23:05,347 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:05,347 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:05,347 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:05,347 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:05,347 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:05,347 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:05,347 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:05,348 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:05,348 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:05,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {58697#true} assume !false; {58697#true} is VALID [2022-04-28 15:23:05,348 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:05,348 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:05,348 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:05,348 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:05,348 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:05,348 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:05,348 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:05,348 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:05,348 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:05,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {58697#true} assume 8464 == #t~mem55;havoc #t~mem55; {58697#true} is VALID [2022-04-28 15:23:05,349 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:05,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {58697#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58697#true} is VALID [2022-04-28 15:23:05,349 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:05,349 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:05,349 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:05,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {58697#true} ~skip~0 := 0; {58697#true} is VALID [2022-04-28 15:23:05,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {58697#true} assume !false; {58697#true} is VALID [2022-04-28 15:23:05,349 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:05,349 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:05,349 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:05,349 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:05,349 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:05,350 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:05,350 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:05,350 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:05,350 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:05,350 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:05,350 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:05,350 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:05,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {58697#true} assume 8496 == #t~mem58;havoc #t~mem58; {58697#true} is VALID [2022-04-28 15:23:05,350 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:05,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {58697#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58697#true} is VALID [2022-04-28 15:23:05,350 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:05,351 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:05,352 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:05,353 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:05,353 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:05,353 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:05,354 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:05,354 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:05,354 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:05,355 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:05,355 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:05,356 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:05,356 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:05,356 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:05,356 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:05,357 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:05,357 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:05,357 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:05,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {58698#false} ~skip~0 := 0; {58698#false} is VALID [2022-04-28 15:23:05,357 INFO L290 TraceCheckUtils]: 66: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:05,357 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:05,357 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:05,357 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:05,357 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:05,357 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:05,357 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:05,357 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,358 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:05,359 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:05,359 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:05,359 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:05,359 INFO L290 TraceCheckUtils]: 89: Hoare triple {58698#false} assume 8448 == #t~mem68;havoc #t~mem68; {58698#false} is VALID [2022-04-28 15:23:05,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {58698#false} assume !(~num1~0 > 0); {58698#false} is VALID [2022-04-28 15:23:05,359 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:05,359 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:05,359 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:05,359 INFO L290 TraceCheckUtils]: 94: Hoare triple {58698#false} ~skip~0 := 0; {58698#false} is VALID [2022-04-28 15:23:05,359 INFO L290 TraceCheckUtils]: 95: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:05,359 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:05,359 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:05,359 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,360 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:05,361 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:05,361 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:05,361 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:05,361 INFO L290 TraceCheckUtils]: 114: Hoare triple {58698#false} assume 8544 == #t~mem64;havoc #t~mem64; {58698#false} is VALID [2022-04-28 15:23:05,361 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:05,361 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:05,361 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:05,361 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:05,361 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:05,361 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:05,361 INFO L290 TraceCheckUtils]: 121: Hoare triple {58698#false} assume 8 == ~blastFlag~0; {58698#false} is VALID [2022-04-28 15:23:05,361 INFO L290 TraceCheckUtils]: 122: Hoare triple {58698#false} assume !false; {58698#false} is VALID [2022-04-28 15:23:05,362 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:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431123041] [2022-04-28 15:23:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431123041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:05,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:05,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:05,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1992492974] [2022-04-28 15:23:05,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1992492974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:05,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:05,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857930855] [2022-04-28 15:23:05,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:05,363 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:05,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:05,364 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:05,442 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:05,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:05,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:05,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:05,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:05,443 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:08,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:11,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:12,142 INFO L93 Difference]: Finished difference Result 890 states and 1337 transitions. [2022-04-28 15:23:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:12,142 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:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:12,142 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:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:23:12,144 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:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:23:12,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:23:12,516 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:12,526 INFO L225 Difference]: With dead ends: 890 [2022-04-28 15:23:12,526 INFO L226 Difference]: Without dead ends: 490 [2022-04-28 15:23:12,527 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:12,527 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 127 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:12,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 15:23:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-04-28 15:23:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 426. [2022-04-28 15:23:12,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:12,555 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:12,556 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:12,556 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:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:12,564 INFO L93 Difference]: Finished difference Result 490 states and 722 transitions. [2022-04-28 15:23:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 722 transitions. [2022-04-28 15:23:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:12,565 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:12,565 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:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:12,574 INFO L93 Difference]: Finished difference Result 490 states and 722 transitions. [2022-04-28 15:23:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 722 transitions. [2022-04-28 15:23:12,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:12,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:12,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:12,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:12,575 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:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 631 transitions. [2022-04-28 15:23:12,583 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 631 transitions. Word has length 123 [2022-04-28 15:23:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:12,583 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 631 transitions. [2022-04-28 15:23:12,583 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:12,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 631 transitions. [2022-04-28 15:23:13,148 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:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 631 transitions. [2022-04-28 15:23:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 15:23:13,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:13,149 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:13,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:23:13,149 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1085696608, now seen corresponding path program 1 times [2022-04-28 15:23:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:13,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856241756] [2022-04-28 15:23:13,233 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:13,233 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1085696608, now seen corresponding path program 2 times [2022-04-28 15:23:13,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:13,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934698624] [2022-04-28 15:23:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:13,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:13,383 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:13,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {62321#true} assume true; {62321#true} is VALID [2022-04-28 15:23:13,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62321#true} {62321#true} #689#return; {62321#true} is VALID [2022-04-28 15:23:13,384 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:13,384 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:13,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {62321#true} assume true; {62321#true} is VALID [2022-04-28 15:23:13,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62321#true} {62321#true} #689#return; {62321#true} is VALID [2022-04-28 15:23:13,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {62321#true} call #t~ret161 := main(); {62321#true} is VALID [2022-04-28 15:23:13,385 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:13,385 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:13,385 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:13,385 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:13,385 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:13,385 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:13,386 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:13,386 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:13,386 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:13,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {62321#true} assume !false; {62321#true} is VALID [2022-04-28 15:23:13,386 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:13,386 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:13,386 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:13,386 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:13,386 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:13,386 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:13,387 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:13,387 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:13,387 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:13,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {62321#true} assume 8464 == #t~mem55;havoc #t~mem55; {62321#true} is VALID [2022-04-28 15:23:13,387 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:13,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {62321#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62321#true} is VALID [2022-04-28 15:23:13,387 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:13,387 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:13,387 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:13,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {62321#true} ~skip~0 := 0; {62321#true} is VALID [2022-04-28 15:23:13,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {62321#true} assume !false; {62321#true} is VALID [2022-04-28 15:23:13,387 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 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:13,388 INFO L290 TraceCheckUtils]: 44: Hoare triple {62321#true} assume 8496 == #t~mem58;havoc #t~mem58; {62321#true} is VALID [2022-04-28 15:23:13,389 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:13,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {62321#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62321#true} is VALID [2022-04-28 15:23:13,389 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:13,389 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:13,390 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:13,391 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:13,391 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:13,391 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:13,392 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:13,392 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:13,393 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:13,393 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:13,393 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:13,394 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:13,394 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:13,394 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:13,395 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:13,395 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:13,396 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:13,396 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:13,396 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:13,397 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:13,397 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:13,398 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:13,398 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:13,398 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:13,399 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:13,399 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:13,400 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:13,400 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:13,400 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:13,401 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:13,401 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:13,401 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:13,402 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:13,402 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:13,403 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:13,403 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:13,403 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:13,404 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:13,404 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:13,405 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:13,405 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:13,405 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:13,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {62322#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {62322#false} is VALID [2022-04-28 15:23:13,405 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:13,405 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:13,405 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:13,406 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:13,406 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:13,406 INFO L290 TraceCheckUtils]: 95: Hoare triple {62322#false} ~skip~0 := 0; {62322#false} is VALID [2022-04-28 15:23:13,406 INFO L290 TraceCheckUtils]: 96: Hoare triple {62322#false} assume !false; {62322#false} is VALID [2022-04-28 15:23:13,406 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:13,406 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:13,406 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:13,406 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:13,406 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:13,406 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:13,406 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:13,406 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,407 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 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:13,408 INFO L290 TraceCheckUtils]: 126: Hoare triple {62322#false} assume 8640 == #t~mem75;havoc #t~mem75; {62322#false} is VALID [2022-04-28 15:23:13,408 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:13,408 INFO L290 TraceCheckUtils]: 128: Hoare triple {62322#false} assume 5 == ~blastFlag~0; {62322#false} is VALID [2022-04-28 15:23:13,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {62322#false} assume !false; {62322#false} is VALID [2022-04-28 15:23:13,409 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:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:13,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934698624] [2022-04-28 15:23:13,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934698624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:13,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:13,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:13,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:13,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856241756] [2022-04-28 15:23:13,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856241756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:13,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:13,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:13,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169694717] [2022-04-28 15:23:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:13,411 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:13,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:13,411 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:13,498 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:13,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:13,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:13,499 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:17,450 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:23:22,836 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:23:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:25,268 INFO L93 Difference]: Finished difference Result 932 states and 1384 transitions. [2022-04-28 15:23:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:25,268 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:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:25,268 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:23:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:23:25,270 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:23:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:23:25,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:23:25,655 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:23:25,666 INFO L225 Difference]: With dead ends: 932 [2022-04-28 15:23:25,666 INFO L226 Difference]: Without dead ends: 532 [2022-04-28 15:23:25,666 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:25,667 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:25,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 365 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:23:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-04-28 15:23:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 469. [2022-04-28 15:23:25,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:25,706 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:23:25,706 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:23:25,707 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:23:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:25,720 INFO L93 Difference]: Finished difference Result 532 states and 782 transitions. [2022-04-28 15:23:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 782 transitions. [2022-04-28 15:23:25,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:25,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:25,722 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:23:25,722 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:23:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:25,736 INFO L93 Difference]: Finished difference Result 532 states and 782 transitions. [2022-04-28 15:23:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 782 transitions. [2022-04-28 15:23:25,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:25,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:25,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:25,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:25,737 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:23:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 695 transitions. [2022-04-28 15:23:25,751 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 695 transitions. Word has length 130 [2022-04-28 15:23:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:25,752 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 695 transitions. [2022-04-28 15:23:25,752 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:23:25,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 695 transitions. [2022-04-28 15:23:26,400 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:23:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 695 transitions. [2022-04-28 15:23:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:23:26,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:26,401 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:23:26,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:23:26,401 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 1 times [2022-04-28 15:23:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:26,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642444324] [2022-04-28 15:23:26,500 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:26,500 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 2 times [2022-04-28 15:23:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:26,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162991388] [2022-04-28 15:23:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:26,656 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:23:26,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {66199#true} assume true; {66199#true} is VALID [2022-04-28 15:23:26,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66199#true} {66199#true} #689#return; {66199#true} is VALID [2022-04-28 15:23:26,657 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:23:26,657 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:23:26,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {66199#true} assume true; {66199#true} is VALID [2022-04-28 15:23:26,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66199#true} {66199#true} #689#return; {66199#true} is VALID [2022-04-28 15:23:26,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {66199#true} call #t~ret161 := main(); {66199#true} is VALID [2022-04-28 15:23:26,657 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {66199#true} assume !false; {66199#true} is VALID [2022-04-28 15:23:26,658 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:23:26,658 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:23:26,658 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:23:26,658 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:23:26,659 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:23:26,659 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:23:26,659 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:23:26,659 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:23:26,659 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:23:26,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {66199#true} assume 8464 == #t~mem55;havoc #t~mem55; {66199#true} is VALID [2022-04-28 15:23:26,659 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:23:26,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {66199#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66199#true} is VALID [2022-04-28 15:23:26,659 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:23:26,659 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:23:26,659 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:23:26,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {66199#true} ~skip~0 := 0; {66199#true} is VALID [2022-04-28 15:23:26,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {66199#true} assume !false; {66199#true} is VALID [2022-04-28 15:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 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:23:26,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {66199#true} assume 8496 == #t~mem58;havoc #t~mem58; {66199#true} is VALID [2022-04-28 15:23:26,661 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:23:26,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {66199#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66199#true} is VALID [2022-04-28 15:23:26,661 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:23:26,661 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:23:26,662 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:23:26,663 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:23:26,663 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:23:26,664 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:23:26,664 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:23:26,664 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:23:26,665 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:23:26,665 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:23:26,666 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:23:26,666 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:23:26,667 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:23:26,667 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:23:26,668 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:23:26,668 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:23:26,668 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:23:26,669 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:23:26,669 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:23:26,669 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:23:26,670 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:23:26,670 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:23:26,671 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {66200#false} ~skip~0 := 0; {66200#false} is VALID [2022-04-28 15:23:26,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,672 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 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:23:26,673 INFO L290 TraceCheckUtils]: 92: Hoare triple {66200#false} assume 8528 == #t~mem62;havoc #t~mem62; {66200#false} is VALID [2022-04-28 15:23:26,673 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:23:26,673 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:23:26,673 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:23:26,674 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:23:26,674 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:23:26,674 INFO L290 TraceCheckUtils]: 98: Hoare triple {66200#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {66200#false} is VALID [2022-04-28 15:23:26,674 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:23:26,674 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:23:26,674 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:23:26,674 INFO L290 TraceCheckUtils]: 102: Hoare triple {66200#false} ~skip~0 := 0; {66200#false} is VALID [2022-04-28 15:23:26,674 INFO L290 TraceCheckUtils]: 103: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:23:26,674 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:23:26,674 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:23:26,674 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:23:26,674 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:23:26,674 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:23:26,674 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 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:23:26,675 INFO L290 TraceCheckUtils]: 122: Hoare triple {66200#false} assume 8544 == #t~mem64;havoc #t~mem64; {66200#false} is VALID [2022-04-28 15:23:26,676 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:23:26,676 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:23:26,676 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:23:26,676 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:23:26,676 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:23:26,676 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:23:26,676 INFO L290 TraceCheckUtils]: 129: Hoare triple {66200#false} assume 8 == ~blastFlag~0; {66200#false} is VALID [2022-04-28 15:23:26,676 INFO L290 TraceCheckUtils]: 130: Hoare triple {66200#false} assume !false; {66200#false} is VALID [2022-04-28 15:23:26,677 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:23:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162991388] [2022-04-28 15:23:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162991388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:26,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:26,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:26,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642444324] [2022-04-28 15:23:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642444324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:26,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:26,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20739227] [2022-04-28 15:23:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:26,678 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:23:26,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:26,678 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:23:26,762 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:23:26,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:26,763 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:23:28,790 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:23:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:29,943 INFO L93 Difference]: Finished difference Result 983 states and 1459 transitions. [2022-04-28 15:23:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:29,943 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:23:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:29,943 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:23:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:23:29,945 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:23:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:23:29,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-04-28 15:23:30,271 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:23:30,283 INFO L225 Difference]: With dead ends: 983 [2022-04-28 15:23:30,283 INFO L226 Difference]: Without dead ends: 540 [2022-04-28 15:23:30,283 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:30,284 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 65 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:30,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 527 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:23:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-04-28 15:23:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 495. [2022-04-28 15:23:30,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:30,325 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:23:30,325 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:23:30,326 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:23:30,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:30,335 INFO L93 Difference]: Finished difference Result 540 states and 793 transitions. [2022-04-28 15:23:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2022-04-28 15:23:30,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:30,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:30,336 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:23:30,336 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:23:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:30,350 INFO L93 Difference]: Finished difference Result 540 states and 793 transitions. [2022-04-28 15:23:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 793 transitions. [2022-04-28 15:23:30,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:30,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:30,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:30,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:30,351 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:23:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 732 transitions. [2022-04-28 15:23:30,367 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 732 transitions. Word has length 131 [2022-04-28 15:23:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:30,367 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 732 transitions. [2022-04-28 15:23:30,367 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:23:30,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 732 transitions. [2022-04-28 15:23:31,051 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:23:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 732 transitions. [2022-04-28 15:23:31,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:23:31,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:31,053 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:23:31,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:23:31,053 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:31,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:31,053 INFO L85 PathProgramCache]: Analyzing trace with hash -22008148, now seen corresponding path program 1 times [2022-04-28 15:23:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:31,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523351946] [2022-04-28 15:23:31,127 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:31,127 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash -22008148, now seen corresponding path program 2 times [2022-04-28 15:23:31,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:31,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028580753] [2022-04-28 15:23:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:31,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:31,260 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:23:31,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {70247#true} assume true; {70247#true} is VALID [2022-04-28 15:23:31,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70247#true} {70247#true} #689#return; {70247#true} is VALID [2022-04-28 15:23:31,261 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:23:31,262 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:23:31,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {70247#true} assume true; {70247#true} is VALID [2022-04-28 15:23:31,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70247#true} {70247#true} #689#return; {70247#true} is VALID [2022-04-28 15:23:31,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {70247#true} call #t~ret161 := main(); {70247#true} is VALID [2022-04-28 15:23:31,262 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:23:31,262 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:23:31,262 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:23:31,262 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:23:31,262 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:23:31,262 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:23:31,262 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:23:31,262 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:23:31,263 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:23:31,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {70247#true} assume !false; {70247#true} is VALID [2022-04-28 15:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 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:23:31,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {70247#true} assume 8464 == #t~mem55;havoc #t~mem55; {70247#true} is VALID [2022-04-28 15:23:31,264 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:23:31,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {70247#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70247#true} is VALID [2022-04-28 15:23:31,264 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:23:31,264 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:23:31,264 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:23:31,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {70247#true} ~skip~0 := 0; {70247#true} is VALID [2022-04-28 15:23:31,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {70247#true} assume !false; {70247#true} is VALID [2022-04-28 15:23:31,264 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:23:31,264 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:23:31,264 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:23:31,264 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:23:31,264 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:23:31,264 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:23:31,265 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:23:31,265 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:23:31,265 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:23:31,265 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:23:31,265 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:23:31,265 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:23:31,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {70247#true} assume 8496 == #t~mem58;havoc #t~mem58; {70247#true} is VALID [2022-04-28 15:23:31,265 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:23:31,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {70247#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70247#true} is VALID [2022-04-28 15:23:31,265 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:23:31,266 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:23:31,267 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:23:31,267 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:23:31,268 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:23:31,268 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:23:31,268 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:23:31,269 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:23:31,269 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:23:31,270 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:23:31,270 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:23:31,270 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:23:31,271 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:23:31,271 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:23:31,272 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:23:31,272 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:23:31,272 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:23:31,273 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:23:31,273 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:23:31,274 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:23:31,274 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:23:31,274 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:23:31,275 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:23:31,275 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:23:31,276 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:23:31,276 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:23:31,276 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:23:31,277 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:23:31,277 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:23:31,278 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:23:31,278 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:23:31,279 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:23:31,279 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:23:31,279 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:23:31,280 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:23:31,280 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:23:31,281 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:23:31,281 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:23:31,281 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:23:31,281 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:23:31,282 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:23:31,282 INFO L290 TraceCheckUtils]: 88: Hoare triple {70248#false} assume 8673 == #t~mem80;havoc #t~mem80; {70248#false} is VALID [2022-04-28 15:23:31,282 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:23:31,282 INFO L290 TraceCheckUtils]: 90: Hoare triple {70248#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70248#false} is VALID [2022-04-28 15:23:31,282 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:23:31,282 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:23:31,282 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:23:31,282 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:23:31,282 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:23:31,282 INFO L290 TraceCheckUtils]: 96: Hoare triple {70248#false} ~skip~0 := 0; {70248#false} is VALID [2022-04-28 15:23:31,282 INFO L290 TraceCheckUtils]: 97: Hoare triple {70248#false} assume !false; {70248#false} is VALID [2022-04-28 15:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,283 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,284 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:23:31,285 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:23:31,285 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:23:31,285 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:23:31,285 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:23:31,285 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:23:31,285 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:23:31,285 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:23:31,285 INFO L290 TraceCheckUtils]: 127: Hoare triple {70248#false} assume 8640 == #t~mem75;havoc #t~mem75; {70248#false} is VALID [2022-04-28 15:23:31,285 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:23:31,285 INFO L290 TraceCheckUtils]: 129: Hoare triple {70248#false} assume 5 == ~blastFlag~0; {70248#false} is VALID [2022-04-28 15:23:31,285 INFO L290 TraceCheckUtils]: 130: Hoare triple {70248#false} assume !false; {70248#false} is VALID [2022-04-28 15:23:31,286 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:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:31,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028580753] [2022-04-28 15:23:31,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028580753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:31,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:31,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:31,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:31,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523351946] [2022-04-28 15:23:31,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523351946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:31,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:31,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:23:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767847191] [2022-04-28 15:23:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:31,287 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:23:31,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:31,288 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:23:31,381 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:23:31,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:23:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:23:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:23:31,381 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:23:34,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:23:40,296 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:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:41,466 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2022-04-28 15:23:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:23:41,466 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:23:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:41,466 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:23:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:23:41,468 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:23:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:23:41,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 15:23:41,789 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:23:41,800 INFO L225 Difference]: With dead ends: 1003 [2022-04-28 15:23:41,800 INFO L226 Difference]: Without dead ends: 534 [2022-04-28 15:23:41,801 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:41,801 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:41,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 533 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 15:23:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-04-28 15:23:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2022-04-28 15:23:41,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:41,832 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:23:41,832 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:23:41,833 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:23:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:41,844 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:23:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:23:41,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:41,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:41,845 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:23:41,846 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:23:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:41,865 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:23:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:23:41,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:41,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:41,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:41,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:41,866 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:23:41,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 756 transitions. [2022-04-28 15:23:41,878 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 756 transitions. Word has length 131 [2022-04-28 15:23:41,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:41,878 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 756 transitions. [2022-04-28 15:23:41,878 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:23:41,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 512 states and 756 transitions. [2022-04-28 15:23:42,587 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:23:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 756 transitions. [2022-04-28 15:23:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:23:42,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:42,588 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:23:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:23:42,588 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 1 times [2022-04-28 15:23:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:42,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598811750] [2022-04-28 15:23:42,686 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:42,686 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 2 times [2022-04-28 15:23:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:42,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105165244] [2022-04-28 15:23:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:42,848 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:23:42,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {74357#true} assume true; {74357#true} is VALID [2022-04-28 15:23:42,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74357#true} {74357#true} #689#return; {74357#true} is VALID [2022-04-28 15:23:42,849 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:23:42,850 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:23:42,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {74357#true} assume true; {74357#true} is VALID [2022-04-28 15:23:42,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74357#true} {74357#true} #689#return; {74357#true} is VALID [2022-04-28 15:23:42,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {74357#true} call #t~ret161 := main(); {74357#true} is VALID [2022-04-28 15:23:42,850 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:23:42,850 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:23:42,850 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:23:42,850 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:23:42,850 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:23:42,850 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:23:42,850 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:23:42,851 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:23:42,851 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:23:42,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {74357#true} assume !false; {74357#true} is VALID [2022-04-28 15:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,851 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:23:42,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {74357#true} assume 8464 == #t~mem55;havoc #t~mem55; {74357#true} is VALID [2022-04-28 15:23:42,852 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:23:42,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {74357#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74357#true} is VALID [2022-04-28 15:23:42,852 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:23:42,852 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:23:42,852 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:23:42,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {74357#true} ~skip~0 := 0; {74357#true} is VALID [2022-04-28 15:23:42,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {74357#true} assume !false; {74357#true} is VALID [2022-04-28 15:23:42,852 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:23:42,852 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:23:42,852 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:23:42,852 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 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:23:42,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {74357#true} assume 8496 == #t~mem58;havoc #t~mem58; {74357#true} is VALID [2022-04-28 15:23:42,853 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:23:42,854 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:23:42,854 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:23:42,854 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:23:42,855 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:23:42,855 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:23:42,855 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:23:42,855 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:23:42,856 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:23:42,856 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:23:42,856 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:23:42,857 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:23:42,857 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:23:42,857 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:23:42,858 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:23:42,858 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:23:42,858 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:23:42,858 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:23:42,859 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:23:42,859 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:23:42,859 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:23:42,860 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:23:42,860 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:23:42,860 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:23:42,861 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:23:42,861 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:23:42,861 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:23:42,861 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:23:42,862 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:23:42,862 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:23:42,862 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:23:42,863 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:23:42,863 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:23:42,863 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:23:42,864 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:23:42,864 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:23:42,864 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:23:42,864 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:23:42,865 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:23:42,865 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:23:42,865 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:23:42,866 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:23:42,866 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:23:42,866 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:23:42,867 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:23:42,867 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:23:42,867 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:23:42,867 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:23:42,868 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:23:42,868 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:23:42,868 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:23:42,869 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:23:42,869 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:23:42,869 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:23:42,870 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:23:42,870 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:23:42,870 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:23:42,871 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:23:42,871 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:23:42,871 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:23:42,871 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:23:42,872 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:23:42,872 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:23:42,872 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:23:42,873 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:23:42,873 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:23:42,873 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:23:42,874 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:23:42,874 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:23:42,874 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:23:42,875 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:23:42,875 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:23:42,875 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:23:42,875 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:23:42,876 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:23:42,876 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:23:42,876 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:23:42,877 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:23:42,877 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:23:42,877 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:23:42,877 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:23:42,878 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:23:42,878 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:23:42,878 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:23:42,879 INFO L290 TraceCheckUtils]: 129: Hoare triple {74362#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {74358#false} is VALID [2022-04-28 15:23:42,879 INFO L290 TraceCheckUtils]: 130: Hoare triple {74358#false} assume !false; {74358#false} is VALID [2022-04-28 15:23:42,879 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:23:42,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105165244] [2022-04-28 15:23:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105165244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:42,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:42,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598811750] [2022-04-28 15:23:42,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598811750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:42,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:42,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456178066] [2022-04-28 15:23:42,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:42,883 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:23:42,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:42,884 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:23:42,951 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:23:42,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:23:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:23:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:23:42,954 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:23:47,033 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:49,055 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:23:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:49,950 INFO L93 Difference]: Finished difference Result 1437 states and 2141 transitions. [2022-04-28 15:23:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:23:49,950 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:23:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:49,950 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:23:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-28 15:23:49,952 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:23:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2022-04-28 15:23:49,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 599 transitions. [2022-04-28 15:23:50,343 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:23:50,386 INFO L225 Difference]: With dead ends: 1437 [2022-04-28 15:23:50,386 INFO L226 Difference]: Without dead ends: 951 [2022-04-28 15:23:50,387 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:23:50,387 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:50,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 434 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 15:23:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-04-28 15:23:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-04-28 15:23:50,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:50,461 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:23:50,462 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:23:50,462 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:23:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:50,488 INFO L93 Difference]: Finished difference Result 951 states and 1407 transitions. [2022-04-28 15:23:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:23:50,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:50,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:50,490 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:23:50,490 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:23:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:50,515 INFO L93 Difference]: Finished difference Result 951 states and 1407 transitions. [2022-04-28 15:23:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:23:50,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:50,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:50,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:50,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:50,517 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:23:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1407 transitions. [2022-04-28 15:23:50,564 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1407 transitions. Word has length 131 [2022-04-28 15:23:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:50,564 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1407 transitions. [2022-04-28 15:23:50,565 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:23:50,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 951 states and 1407 transitions. [2022-04-28 15:23:51,917 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:23:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1407 transitions. [2022-04-28 15:23:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:23:51,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:51,919 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:23:51,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:23:51,920 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 1 times [2022-04-28 15:23:51,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:51,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1154025925] [2022-04-28 15:23:52,009 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:52,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 2 times [2022-04-28 15:23:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:52,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801694874] [2022-04-28 15:23:52,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:52,129 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:23:52,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {81044#true} assume true; {81044#true} is VALID [2022-04-28 15:23:52,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81044#true} {81044#true} #689#return; {81044#true} is VALID [2022-04-28 15:23:52,130 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:23:52,130 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:23:52,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {81044#true} assume true; {81044#true} is VALID [2022-04-28 15:23:52,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81044#true} {81044#true} #689#return; {81044#true} is VALID [2022-04-28 15:23:52,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {81044#true} call #t~ret161 := main(); {81044#true} is VALID [2022-04-28 15:23:52,130 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:23:52,130 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {81044#true} assume !false; {81044#true} is VALID [2022-04-28 15:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,131 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:23:52,132 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:23:52,132 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:23:52,132 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:23:52,132 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:23:52,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {81044#true} assume 8464 == #t~mem55;havoc #t~mem55; {81044#true} is VALID [2022-04-28 15:23:52,132 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:23:52,132 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:23:52,132 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:23:52,133 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:23:52,133 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:23:52,133 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:23:52,134 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:23:52,134 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:23:52,134 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:23:52,135 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:23:52,135 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:23:52,135 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:23:52,135 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:23:52,136 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:23:52,136 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:23:52,136 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:23:52,137 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:23:52,137 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:23:52,137 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:23:52,137 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:23:52,138 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:23:52,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {81049#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81045#false} is VALID [2022-04-28 15:23:52,138 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:23:52,138 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:23:52,138 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:23:52,138 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:23:52,139 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:23:52,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:23:52,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,139 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:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {81045#false} assume 8512 == #t~mem60;havoc #t~mem60; {81045#false} is VALID [2022-04-28 15:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 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:23:52,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:23:52,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:23:52,140 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,141 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:23:52,142 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:23:52,142 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:23:52,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {81045#false} assume 8528 == #t~mem62;havoc #t~mem62; {81045#false} is VALID [2022-04-28 15:23:52,142 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:23:52,142 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:23:52,142 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:23:52,142 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:23:52,142 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:23:52,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {81045#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81045#false} is VALID [2022-04-28 15:23:52,142 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:23:52,142 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:23:52,142 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:23:52,142 INFO L290 TraceCheckUtils]: 102: Hoare triple {81045#false} ~skip~0 := 0; {81045#false} is VALID [2022-04-28 15:23:52,142 INFO L290 TraceCheckUtils]: 103: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,143 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 INFO L290 TraceCheckUtils]: 122: Hoare triple {81045#false} assume 8544 == #t~mem64;havoc #t~mem64; {81045#false} is VALID [2022-04-28 15:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 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:23:52,144 INFO L290 TraceCheckUtils]: 129: Hoare triple {81045#false} assume 8 == ~blastFlag~0; {81045#false} is VALID [2022-04-28 15:23:52,144 INFO L290 TraceCheckUtils]: 130: Hoare triple {81045#false} assume !false; {81045#false} is VALID [2022-04-28 15:23:52,145 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:23:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:52,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801694874] [2022-04-28 15:23:52,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801694874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:52,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:52,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1154025925] [2022-04-28 15:23:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1154025925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:52,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:52,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412443459] [2022-04-28 15:23:52,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:52,146 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:23:52,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:52,147 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:23:52,224 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:23:52,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:23:52,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:23:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:23:52,225 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:23:54,249 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:23:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:55,109 INFO L93 Difference]: Finished difference Result 1903 states and 2821 transitions. [2022-04-28 15:23:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:23:55,109 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:23:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:23:55,109 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:23:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:23:55,111 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:23:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:23:55,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-28 15:23:55,391 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:23:55,431 INFO L225 Difference]: With dead ends: 1903 [2022-04-28 15:23:55,431 INFO L226 Difference]: Without dead ends: 978 [2022-04-28 15:23:55,432 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:23:55,433 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:23:55,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:23:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-04-28 15:23:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2022-04-28 15:23:55,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:23:55,528 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:23:55,529 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:23:55,529 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:23:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:55,568 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2022-04-28 15:23:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:23:55,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:55,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:55,572 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:23:55,573 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:23:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:23:55,599 INFO L93 Difference]: Finished difference Result 978 states and 1442 transitions. [2022-04-28 15:23:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:23:55,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:23:55,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:23:55,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:23:55,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:23:55,601 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:23:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1442 transitions. [2022-04-28 15:23:55,641 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1442 transitions. Word has length 131 [2022-04-28 15:23:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:23:55,641 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 1442 transitions. [2022-04-28 15:23:55,641 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:23:55,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 978 states and 1442 transitions. [2022-04-28 15:23:57,013 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:23:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1442 transitions. [2022-04-28 15:23:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:23:57,014 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:23:57,015 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:23:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:23:57,015 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:23:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:23:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 1 times [2022-04-28 15:23:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:57,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306496780] [2022-04-28 15:23:57,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:23:57,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:23:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 2 times [2022-04-28 15:23:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:23:57,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678826581] [2022-04-28 15:23:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:23:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:23:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:23:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:23:57,218 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:23:57,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {88771#true} assume true; {88771#true} is VALID [2022-04-28 15:23:57,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88771#true} {88771#true} #689#return; {88771#true} is VALID [2022-04-28 15:23:57,219 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:23:57,219 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:23:57,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {88771#true} assume true; {88771#true} is VALID [2022-04-28 15:23:57,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88771#true} {88771#true} #689#return; {88771#true} is VALID [2022-04-28 15:23:57,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {88771#true} call #t~ret161 := main(); {88771#true} is VALID [2022-04-28 15:23:57,220 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:23:57,220 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:23:57,220 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:23:57,220 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:23:57,220 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:23:57,221 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:23:57,221 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:23:57,221 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:23:57,222 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:23:57,222 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:23:57,222 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:23:57,222 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:23:57,223 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:23:57,223 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:23:57,223 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:23:57,224 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:23:57,224 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:23:57,224 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:23:57,225 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:23:57,225 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:23:57,225 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:23:57,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {88776#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88772#false} is VALID [2022-04-28 15:23:57,226 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:23:57,226 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:23:57,226 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:23:57,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:23:57,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:23:57,226 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:23:57,226 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:23:57,226 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:23:57,226 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:23:57,226 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:23:57,226 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:23:57,227 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:23:57,227 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:23:57,227 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:23:57,227 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:23:57,227 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:23:57,227 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:23:57,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {88772#false} assume 8496 == #t~mem58;havoc #t~mem58; {88772#false} is VALID [2022-04-28 15:23:57,227 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:23:57,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {88772#false} assume !(1 == ~blastFlag~0); {88772#false} is VALID [2022-04-28 15:23:57,227 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:23:57,227 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:23:57,227 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:23:57,227 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:23:57,228 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:23:57,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:23:57,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,228 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:23:57,229 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:23:57,229 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:23:57,229 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:23:57,229 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:23:57,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {88772#false} assume 8512 == #t~mem60;havoc #t~mem60; {88772#false} is VALID [2022-04-28 15:23:57,229 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:23:57,229 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:23:57,229 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:23:57,229 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:23:57,229 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:23:57,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:23:57,229 INFO L290 TraceCheckUtils]: 75: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,230 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:23:57,231 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:23:57,231 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:23:57,231 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:23:57,231 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:23:57,231 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:23:57,231 INFO L290 TraceCheckUtils]: 92: Hoare triple {88772#false} assume 8528 == #t~mem62;havoc #t~mem62; {88772#false} is VALID [2022-04-28 15:23:57,231 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:23:57,231 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:23:57,231 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:23:57,231 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:23:57,231 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:23:57,232 INFO L290 TraceCheckUtils]: 98: Hoare triple {88772#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88772#false} is VALID [2022-04-28 15:23:57,232 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:23:57,232 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:23:57,232 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:23:57,232 INFO L290 TraceCheckUtils]: 102: Hoare triple {88772#false} ~skip~0 := 0; {88772#false} is VALID [2022-04-28 15:23:57,232 INFO L290 TraceCheckUtils]: 103: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:23:57,232 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:23:57,232 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:23:57,232 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:23:57,232 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:23:57,232 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:23:57,232 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,233 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:23:57,234 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:23:57,234 INFO L290 TraceCheckUtils]: 122: Hoare triple {88772#false} assume 8544 == #t~mem64;havoc #t~mem64; {88772#false} is VALID [2022-04-28 15:23:57,234 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:23:57,234 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:23:57,234 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:23:57,234 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:23:57,234 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:23:57,234 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:23:57,234 INFO L290 TraceCheckUtils]: 129: Hoare triple {88772#false} assume 8 == ~blastFlag~0; {88772#false} is VALID [2022-04-28 15:23:57,234 INFO L290 TraceCheckUtils]: 130: Hoare triple {88772#false} assume !false; {88772#false} is VALID [2022-04-28 15:23:57,235 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:23:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:23:57,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678826581] [2022-04-28 15:23:57,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678826581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:57,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:57,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:57,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:23:57,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306496780] [2022-04-28 15:23:57,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306496780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:23:57,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:23:57,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:23:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657526600] [2022-04-28 15:23:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:23:57,236 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:23:57,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:23:57,236 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:23:57,295 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:23:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:23:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:23:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:23:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:23:57,296 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:23:59,759 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:24:01,763 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:24:03,789 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:24:04,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:04,802 INFO L93 Difference]: Finished difference Result 1932 states and 2857 transitions. [2022-04-28 15:24:04,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:04,802 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:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:04,802 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:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:24:04,804 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:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:24:04,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-28 15:24:05,106 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:05,143 INFO L225 Difference]: With dead ends: 1932 [2022-04-28 15:24:05,143 INFO L226 Difference]: Without dead ends: 980 [2022-04-28 15:24:05,144 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:05,144 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:05,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 234 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:24:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-04-28 15:24:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2022-04-28 15:24:05,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:05,209 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:05,209 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:05,210 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:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:05,235 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:24:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:05,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:05,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:05,238 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:05,238 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:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:05,264 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:24:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:05,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:05,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:05,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:05,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:05,266 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:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1444 transitions. [2022-04-28 15:24:05,312 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1444 transitions. Word has length 131 [2022-04-28 15:24:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:05,312 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1444 transitions. [2022-04-28 15:24:05,312 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:05,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 980 states and 1444 transitions. [2022-04-28 15:24:06,691 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:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:24:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:24:06,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:06,692 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:06,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:24:06,693 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 1 times [2022-04-28 15:24:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [680813133] [2022-04-28 15:24:06,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:06,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 2 times [2022-04-28 15:24:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:06,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100601588] [2022-04-28 15:24:06,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:06,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:06,947 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:06,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {96564#true} assume true; {96564#true} is VALID [2022-04-28 15:24:06,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96564#true} {96564#true} #689#return; {96564#true} is VALID [2022-04-28 15:24:06,948 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:06,948 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:06,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {96564#true} assume true; {96564#true} is VALID [2022-04-28 15:24:06,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96564#true} {96564#true} #689#return; {96564#true} is VALID [2022-04-28 15:24:06,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {96564#true} call #t~ret161 := main(); {96564#true} is VALID [2022-04-28 15:24:06,949 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:06,949 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:06,949 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:06,949 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:06,949 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:06,949 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:06,949 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:06,949 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:06,949 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:06,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:06,950 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:06,950 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:06,950 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:06,950 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:06,950 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:06,950 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:06,950 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:06,950 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:06,950 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:06,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {96564#true} assume 8464 == #t~mem55;havoc #t~mem55; {96564#true} is VALID [2022-04-28 15:24:06,950 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:06,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {96564#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96564#true} is VALID [2022-04-28 15:24:06,950 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:06,950 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:06,951 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:06,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {96564#true} ~skip~0 := 0; {96564#true} is VALID [2022-04-28 15:24:06,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,951 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:06,952 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:06,952 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:06,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {96564#true} assume 8496 == #t~mem58;havoc #t~mem58; {96564#true} is VALID [2022-04-28 15:24:06,952 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:06,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {96564#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96564#true} is VALID [2022-04-28 15:24:06,952 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:06,952 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:06,952 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:06,952 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:06,952 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:06,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {96564#true} ~skip~0 := 0; {96564#true} is VALID [2022-04-28 15:24:06,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {96564#true} assume !false; {96564#true} is VALID [2022-04-28 15:24:06,952 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:06,952 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 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:06,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {96564#true} assume 8512 == #t~mem60;havoc #t~mem60; {96564#true} is VALID [2022-04-28 15:24:06,953 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:06,954 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:06,954 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:06,954 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:06,955 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:06,955 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:06,955 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:06,956 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:06,956 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:06,956 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:06,956 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:06,957 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:06,957 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:06,957 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:06,958 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:06,958 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:06,958 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:06,958 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:06,959 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:06,959 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:06,959 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:06,960 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:06,960 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:06,960 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:06,960 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:06,961 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:06,961 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:06,961 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:06,962 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:06,962 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:06,962 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:06,962 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:06,963 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:06,963 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:06,963 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:06,964 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:06,964 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:06,964 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:06,964 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:06,965 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:06,965 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:06,965 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:06,966 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:06,966 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:06,966 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:06,966 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:06,967 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:06,967 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:06,967 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:06,968 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:06,968 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:06,968 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:06,968 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:06,969 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:06,969 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:06,969 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:06,969 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:06,970 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:06,970 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:06,970 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:06,971 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:06,971 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:06,971 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:06,971 INFO L290 TraceCheckUtils]: 132: Hoare triple {96565#false} assume !false; {96565#false} is VALID [2022-04-28 15:24:06,972 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:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:06,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100601588] [2022-04-28 15:24:06,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100601588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:06,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:06,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:06,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:06,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [680813133] [2022-04-28 15:24:06,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [680813133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:06,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:06,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378321089] [2022-04-28 15:24:06,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:06,974 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:06,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:06,974 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:07,042 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:07,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:07,044 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:14,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:16,261 INFO L93 Difference]: Finished difference Result 2418 states and 3582 transitions. [2022-04-28 15:24:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:16,261 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:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:16,261 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:24:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:24:16,264 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:24:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:24:16,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-28 15:24:16,649 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:24:16,738 INFO L225 Difference]: With dead ends: 2418 [2022-04-28 15:24:16,738 INFO L226 Difference]: Without dead ends: 1466 [2022-04-28 15:24:16,739 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:16,740 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:16,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 15:24:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2022-04-28 15:24:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2022-04-28 15:24:17,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:17,298 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:24:17,299 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:24:17,300 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:24:17,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:17,352 INFO L93 Difference]: Finished difference Result 1466 states and 2168 transitions. [2022-04-28 15:24:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2168 transitions. [2022-04-28 15:24:17,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:17,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:17,356 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:24:17,356 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:24:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:17,411 INFO L93 Difference]: Finished difference Result 1466 states and 2168 transitions. [2022-04-28 15:24:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2168 transitions. [2022-04-28 15:24:17,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:17,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:17,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:17,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:17,414 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:24:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2167 transitions. [2022-04-28 15:24:17,508 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2167 transitions. Word has length 133 [2022-04-28 15:24:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:17,509 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2167 transitions. [2022-04-28 15:24:17,509 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:24:17,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1464 states and 2167 transitions. [2022-04-28 15:24:19,579 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:24:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2167 transitions. [2022-04-28 15:24:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:24:19,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:19,581 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:24:19,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:24:19,581 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 1 times [2022-04-28 15:24:19,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:19,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695106061] [2022-04-28 15:24:19,671 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:19,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 2 times [2022-04-28 15:24:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:19,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001654878] [2022-04-28 15:24:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:19,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:19,805 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:24:19,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {107269#true} assume true; {107269#true} is VALID [2022-04-28 15:24:19,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107269#true} {107269#true} #689#return; {107269#true} is VALID [2022-04-28 15:24:19,806 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:24:19,806 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:24:19,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {107269#true} assume true; {107269#true} is VALID [2022-04-28 15:24:19,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107269#true} {107269#true} #689#return; {107269#true} is VALID [2022-04-28 15:24:19,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {107269#true} call #t~ret161 := main(); {107269#true} is VALID [2022-04-28 15:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 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:24:19,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 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:24:19,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {107269#true} assume 8464 == #t~mem55;havoc #t~mem55; {107269#true} is VALID [2022-04-28 15:24:19,808 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:24:19,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {107269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107269#true} is VALID [2022-04-28 15:24:19,808 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:24:19,809 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:24:19,809 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:24:19,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:24:19,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,809 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:24:19,810 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:24:19,810 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:24:19,810 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:24:19,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {107269#true} assume 8496 == #t~mem58;havoc #t~mem58; {107269#true} is VALID [2022-04-28 15:24:19,810 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:24:19,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {107269#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107269#true} is VALID [2022-04-28 15:24:19,810 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:24:19,810 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:24:19,810 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:24:19,810 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:24:19,810 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:24:19,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:24:19,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,811 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:24:19,812 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:24:19,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {107269#true} assume 8512 == #t~mem60;havoc #t~mem60; {107269#true} is VALID [2022-04-28 15:24:19,812 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:24:19,812 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:24:19,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {107269#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107269#true} is VALID [2022-04-28 15:24:19,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {107269#true} assume !(~ret~0 <= 0); {107269#true} is VALID [2022-04-28 15:24:19,812 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:24:19,812 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:24:19,812 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:24:19,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {107269#true} ~skip~0 := 0; {107269#true} is VALID [2022-04-28 15:24:19,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {107269#true} assume !false; {107269#true} is VALID [2022-04-28 15:24:19,812 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:24:19,812 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,813 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:24:19,814 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:24:19,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {107269#true} assume 8528 == #t~mem62;havoc #t~mem62; {107269#true} is VALID [2022-04-28 15:24:19,814 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:24:19,814 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:24:19,814 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:24:19,814 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:24:19,814 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:24:19,814 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:24:19,815 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:24:19,815 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:24:19,815 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:24:19,816 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:24:19,816 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:24:19,816 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:24:19,816 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:24:19,817 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:24:19,817 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:24:19,817 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:24:19,818 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:24:19,818 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:24:19,818 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:24:19,818 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:24:19,819 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:24:19,819 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:24:19,819 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:24:19,820 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:24:19,820 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:24:19,820 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:24:19,820 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:24:19,821 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:24:19,821 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:24:19,821 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:24:19,822 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:24:19,822 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:24:19,822 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:24:19,822 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:24:19,823 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:24:19,823 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:24:19,823 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:24:19,824 INFO L290 TraceCheckUtils]: 132: Hoare triple {107274#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {107270#false} is VALID [2022-04-28 15:24:19,824 INFO L290 TraceCheckUtils]: 133: Hoare triple {107270#false} assume !false; {107270#false} is VALID [2022-04-28 15:24:19,824 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:24:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:19,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001654878] [2022-04-28 15:24:19,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001654878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:19,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:19,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:19,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:19,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695106061] [2022-04-28 15:24:19,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695106061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:19,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:19,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737310549] [2022-04-28 15:24:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:19,826 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:24:19,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:19,826 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:24:19,908 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:24:19,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:19,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:19,909 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:24:24,232 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:24:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:28,503 INFO L93 Difference]: Finished difference Result 1952 states and 2894 transitions. [2022-04-28 15:24:28,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:28,503 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:24:28,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:28,503 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:24:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:24:28,505 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:24:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:24:28,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-28 15:24:28,776 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:24:28,933 INFO L225 Difference]: With dead ends: 1952 [2022-04-28 15:24:28,933 INFO L226 Difference]: Without dead ends: 1950 [2022-04-28 15:24:28,935 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:28,935 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:28,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 15:24:28,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2022-04-28 15:24:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1948. [2022-04-28 15:24:30,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:30,106 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:24:30,107 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:24:30,108 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:24:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:30,202 INFO L93 Difference]: Finished difference Result 1950 states and 2892 transitions. [2022-04-28 15:24:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2892 transitions. [2022-04-28 15:24:30,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:30,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:30,206 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:24:30,207 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:24:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:30,302 INFO L93 Difference]: Finished difference Result 1950 states and 2892 transitions. [2022-04-28 15:24:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2892 transitions. [2022-04-28 15:24:30,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:30,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:30,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:30,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:30,306 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:24:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2891 transitions. [2022-04-28 15:24:30,469 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2891 transitions. Word has length 134 [2022-04-28 15:24:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:30,470 INFO L495 AbstractCegarLoop]: Abstraction has 1948 states and 2891 transitions. [2022-04-28 15:24:30,470 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:24:30,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1948 states and 2891 transitions. [2022-04-28 15:24:33,268 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:24:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2891 transitions. [2022-04-28 15:24:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 15:24:33,270 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:33,271 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:24:33,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:24:33,271 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:33,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1009043547, now seen corresponding path program 1 times [2022-04-28 15:24:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:33,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [543207583] [2022-04-28 15:24:33,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:33,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1009043547, now seen corresponding path program 2 times [2022-04-28 15:24:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743807248] [2022-04-28 15:24:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:33,543 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:24:33,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {118978#true} assume true; {118978#true} is VALID [2022-04-28 15:24:33,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118978#true} {118978#true} #689#return; {118978#true} is VALID [2022-04-28 15:24:33,544 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:24:33,544 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:24:33,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {118978#true} assume true; {118978#true} is VALID [2022-04-28 15:24:33,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118978#true} {118978#true} #689#return; {118978#true} is VALID [2022-04-28 15:24:33,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {118978#true} call #t~ret161 := main(); {118978#true} is VALID [2022-04-28 15:24:33,544 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:24:33,544 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,545 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:24:33,546 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:24:33,546 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:24:33,546 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:24:33,546 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:24:33,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {118978#true} assume 8464 == #t~mem55;havoc #t~mem55; {118978#true} is VALID [2022-04-28 15:24:33,546 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:24:33,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {118978#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {118978#true} is VALID [2022-04-28 15:24:33,546 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:24:33,546 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:24:33,546 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:24:33,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {118978#true} ~skip~0 := 0; {118978#true} is VALID [2022-04-28 15:24:33,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:24:33,546 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 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:24:33,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {118978#true} assume 8496 == #t~mem58;havoc #t~mem58; {118978#true} is VALID [2022-04-28 15:24:33,547 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:24:33,548 INFO L290 TraceCheckUtils]: 46: Hoare triple {118978#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {118978#true} is VALID [2022-04-28 15:24:33,548 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:24:33,548 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:24:33,548 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:24:33,548 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:24:33,548 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:24:33,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {118978#true} ~skip~0 := 0; {118978#true} is VALID [2022-04-28 15:24:33,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {118978#true} assume !false; {118978#true} is VALID [2022-04-28 15:24:33,548 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:24:33,548 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:24:33,548 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:24:33,548 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 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:24:33,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {118978#true} assume 8512 == #t~mem60;havoc #t~mem60; {118978#true} is VALID [2022-04-28 15:24:33,549 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:24:33,549 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:24:33,550 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:24:33,550 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:24:33,550 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:24:33,551 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:24:33,551 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:24:33,551 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:24:33,552 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:24:33,553 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:24:33,553 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:24:33,553 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:24:33,553 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:24:33,554 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:24:33,554 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:24:33,554 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:24:33,555 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:24:33,555 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:24:33,555 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:24:33,556 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:24:33,556 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:24:33,556 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:24:33,557 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:24:33,557 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:24:33,557 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:24:33,557 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:24:33,558 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:24:33,558 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:24:33,558 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:24:33,559 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:24:33,567 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:24:33,567 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:24:33,568 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:24:33,568 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:24:33,568 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:24:33,569 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:24:33,569 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:24:33,569 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:24:33,570 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:24:33,570 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:24:33,570 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:24:33,570 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:24:33,571 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:24:33,571 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:24:33,571 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:24:33,572 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:24:33,572 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:24:33,572 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:24:33,572 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:24:33,572 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:24:33,572 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:24:33,572 INFO L290 TraceCheckUtils]: 120: Hoare triple {118979#false} ~skip~0 := 0; {118979#false} is VALID [2022-04-28 15:24:33,572 INFO L290 TraceCheckUtils]: 121: Hoare triple {118979#false} assume !false; {118979#false} is VALID [2022-04-28 15:24:33,572 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:24:33,572 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,573 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,574 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:24:33,575 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:24:33,575 INFO L290 TraceCheckUtils]: 151: Hoare triple {118979#false} assume 8640 == #t~mem75;havoc #t~mem75; {118979#false} is VALID [2022-04-28 15:24:33,575 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:24:33,575 INFO L290 TraceCheckUtils]: 153: Hoare triple {118979#false} assume 5 == ~blastFlag~0; {118979#false} is VALID [2022-04-28 15:24:33,575 INFO L290 TraceCheckUtils]: 154: Hoare triple {118979#false} assume !false; {118979#false} is VALID [2022-04-28 15:24:33,575 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:24:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743807248] [2022-04-28 15:24:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743807248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:33,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:33,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [543207583] [2022-04-28 15:24:33,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [543207583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:33,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:33,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:33,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391089994] [2022-04-28 15:24:33,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:33,577 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:24:33,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:33,578 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:24:33,671 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:24:33,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:33,672 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:24:35,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:24:37,121 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:24:39,148 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:24:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:43,305 INFO L93 Difference]: Finished difference Result 4354 states and 6474 transitions. [2022-04-28 15:24:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:24:43,305 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:24:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:24:43,305 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:24:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:24:43,307 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:24:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:24:43,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 605 transitions. [2022-04-28 15:24:43,695 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:24:43,942 INFO L225 Difference]: With dead ends: 4354 [2022-04-28 15:24:43,942 INFO L226 Difference]: Without dead ends: 2434 [2022-04-28 15:24:43,944 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:43,944 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 145 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:24:43,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 574 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 424 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:24:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-04-28 15:24:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2432. [2022-04-28 15:24:46,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:24:46,181 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:24:46,183 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:24:46,184 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:24:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:46,347 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:24:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:24:46,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:46,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:46,351 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:24:46,353 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:24:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:24:46,503 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:24:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:24:46,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:24:46,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:24:46,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:24:46,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:24:46,508 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:24:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 3593 transitions. [2022-04-28 15:24:46,763 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 3593 transitions. Word has length 155 [2022-04-28 15:24:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:24:46,763 INFO L495 AbstractCegarLoop]: Abstraction has 2432 states and 3593 transitions. [2022-04-28 15:24:46,763 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:24:46,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2432 states and 3593 transitions. [2022-04-28 15:24:50,392 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:24:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 3593 transitions. [2022-04-28 15:24:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:24:50,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:24:50,395 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:24:50,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:24:50,395 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:24:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:24:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2037465434, now seen corresponding path program 1 times [2022-04-28 15:24:50,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:50,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961919803] [2022-04-28 15:24:50,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:24:50,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:24:50,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2037465434, now seen corresponding path program 2 times [2022-04-28 15:24:50,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:24:50,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616637983] [2022-04-28 15:24:50,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:24:50,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:24:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:24:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:24:50,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {137433#(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:24:50,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {137427#true} assume true; {137427#true} is VALID [2022-04-28 15:24:50,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137427#true} {137427#true} #689#return; {137427#true} is VALID [2022-04-28 15:24:50,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {137427#true} call ULTIMATE.init(); {137433#(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:50,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {137433#(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:24:50,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {137427#true} assume true; {137427#true} is VALID [2022-04-28 15:24:50,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137427#true} {137427#true} #689#return; {137427#true} is VALID [2022-04-28 15:24:50,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {137427#true} call #t~ret161 := main(); {137427#true} is VALID [2022-04-28 15:24:50,649 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:24:50,649 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); {137427#true} is VALID [2022-04-28 15:24:50,649 INFO L272 TraceCheckUtils]: 7: Hoare triple {137427#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {137427#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; {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {137427#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; {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {137427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {137427#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {137427#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {137427#true} assume !false; {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {137427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {137427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {137427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {137427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {137427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {137427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {137427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {137427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {137427#true} assume 8464 == #t~mem55;havoc #t~mem55; {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {137427#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; {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {137427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {137427#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137427#true} is VALID [2022-04-28 15:24:50,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {137427#true} ~skip~0 := 0; {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {137427#true} assume !false; {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {137427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {137427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {137427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {137427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {137427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {137427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {137427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {137427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {137427#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {137427#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {137427#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {137427#true} assume 8496 == #t~mem58;havoc #t~mem58; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {137427#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {137427#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {137427#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {137427#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {137427#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {137427#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 52: Hoare triple {137427#true} ~skip~0 := 0; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {137427#true} assume !false; {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {137427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {137427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {137427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {137427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {137427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {137427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {137427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 62: Hoare triple {137427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 63: Hoare triple {137427#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {137427#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {137427#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {137427#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {137427#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {137427#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 69: Hoare triple {137427#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 70: Hoare triple {137427#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {137427#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {137427#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {137427#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {137427#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 75: Hoare triple {137427#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {137427#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {137427#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {137427#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 79: Hoare triple {137427#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {137427#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {137427#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 82: Hoare triple {137427#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 83: Hoare triple {137427#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 84: Hoare triple {137427#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 85: Hoare triple {137427#true} assume 8656 == #t~mem77;havoc #t~mem77; {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 86: Hoare triple {137427#true} 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; {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 87: Hoare triple {137427#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 88: Hoare triple {137427#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 89: Hoare triple {137427#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {137427#true} assume !(0 == ~tmp___10~0); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 91: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {137427#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 93: Hoare triple {137427#true} ~skip~0 := 0; {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 94: Hoare triple {137427#true} assume !false; {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 95: Hoare triple {137427#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); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 96: Hoare triple {137427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 97: Hoare triple {137427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 98: Hoare triple {137427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 99: Hoare triple {137427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 100: Hoare triple {137427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 101: Hoare triple {137427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 102: Hoare triple {137427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 103: Hoare triple {137427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 104: Hoare triple {137427#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,657 INFO L290 TraceCheckUtils]: 105: Hoare triple {137427#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 106: Hoare triple {137427#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 107: Hoare triple {137427#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 108: Hoare triple {137427#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 109: Hoare triple {137427#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 110: Hoare triple {137427#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 111: Hoare triple {137427#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 112: Hoare triple {137427#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 113: Hoare triple {137427#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 114: Hoare triple {137427#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 115: Hoare triple {137427#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 116: Hoare triple {137427#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 117: Hoare triple {137427#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,658 INFO L290 TraceCheckUtils]: 118: Hoare triple {137427#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 119: Hoare triple {137427#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 120: Hoare triple {137427#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 121: Hoare triple {137427#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 122: Hoare triple {137427#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 123: Hoare triple {137427#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 124: Hoare triple {137427#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 125: Hoare triple {137427#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 126: Hoare triple {137427#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 127: Hoare triple {137427#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 128: Hoare triple {137427#true} assume 8672 == #t~mem79;havoc #t~mem79; {137427#true} is VALID [2022-04-28 15:24:50,659 INFO L290 TraceCheckUtils]: 129: Hoare triple {137427#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {137427#true} is VALID [2022-04-28 15:24:50,660 INFO L290 TraceCheckUtils]: 130: Hoare triple {137427#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,660 INFO L290 TraceCheckUtils]: 131: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} 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); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,661 INFO L290 TraceCheckUtils]: 132: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} 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; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,661 INFO L290 TraceCheckUtils]: 133: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,662 INFO L290 TraceCheckUtils]: 134: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} 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); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,662 INFO L290 TraceCheckUtils]: 135: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,662 INFO L290 TraceCheckUtils]: 136: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} ~skip~0 := 0; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,663 INFO L290 TraceCheckUtils]: 137: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !false; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,663 INFO L290 TraceCheckUtils]: 138: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} 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); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,663 INFO L290 TraceCheckUtils]: 139: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,664 INFO L290 TraceCheckUtils]: 140: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,664 INFO L290 TraceCheckUtils]: 141: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,665 INFO L290 TraceCheckUtils]: 142: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,665 INFO L290 TraceCheckUtils]: 143: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,665 INFO L290 TraceCheckUtils]: 144: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,666 INFO L290 TraceCheckUtils]: 145: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,666 INFO L290 TraceCheckUtils]: 146: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,666 INFO L290 TraceCheckUtils]: 147: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,667 INFO L290 TraceCheckUtils]: 148: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,667 INFO L290 TraceCheckUtils]: 149: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,668 INFO L290 TraceCheckUtils]: 150: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,668 INFO L290 TraceCheckUtils]: 151: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,668 INFO L290 TraceCheckUtils]: 152: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,669 INFO L290 TraceCheckUtils]: 153: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,669 INFO L290 TraceCheckUtils]: 154: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,669 INFO L290 TraceCheckUtils]: 155: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,670 INFO L290 TraceCheckUtils]: 156: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,670 INFO L290 TraceCheckUtils]: 157: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,670 INFO L290 TraceCheckUtils]: 158: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,671 INFO L290 TraceCheckUtils]: 159: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,671 INFO L290 TraceCheckUtils]: 160: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,671 INFO L290 TraceCheckUtils]: 161: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,672 INFO L290 TraceCheckUtils]: 162: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,672 INFO L290 TraceCheckUtils]: 163: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,673 INFO L290 TraceCheckUtils]: 164: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,673 INFO L290 TraceCheckUtils]: 165: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,673 INFO L290 TraceCheckUtils]: 166: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,674 INFO L290 TraceCheckUtils]: 167: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume 8640 == #t~mem75;havoc #t~mem75; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,674 INFO L290 TraceCheckUtils]: 168: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {137432#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 15:24:50,674 INFO L290 TraceCheckUtils]: 169: Hoare triple {137432#(= ssl3_accept_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {137428#false} is VALID [2022-04-28 15:24:50,674 INFO L290 TraceCheckUtils]: 170: Hoare triple {137428#false} assume !false; {137428#false} is VALID [2022-04-28 15:24:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 15:24:50,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:24:50,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616637983] [2022-04-28 15:24:50,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616637983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:50,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:50,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:24:50,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961919803] [2022-04-28 15:24:50,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961919803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:24:50,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:24:50,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:24:50,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541597689] [2022-04-28 15:24:50,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:24:50,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 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 171 [2022-04-28 15:24:50,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:24:50,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:50,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:24:50,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:24:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:24:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:24:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:24:50,778 INFO L87 Difference]: Start difference. First operand 2432 states and 3593 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:53,939 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:58,142 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:25:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:03,084 INFO L93 Difference]: Finished difference Result 5277 states and 7815 transitions. [2022-04-28 15:25:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:25:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 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 171 [2022-04-28 15:25:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2022-04-28 15:25:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2022-04-28 15:25:03,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 601 transitions. [2022-04-28 15:25:03,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 601 edges. 601 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:03,795 INFO L225 Difference]: With dead ends: 5277 [2022-04-28 15:25:03,796 INFO L226 Difference]: Without dead ends: 2873 [2022-04-28 15:25:03,798 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:03,799 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:03,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 579 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 426 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 15:25:03,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2022-04-28 15:25:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2873. [2022-04-28 15:25:06,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:06,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2873 states. Second operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 3 states have call 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,430 INFO L74 IsIncluded]: Start isIncluded. First operand 2873 states. Second operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 3 states have call 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,431 INFO L87 Difference]: Start difference. First operand 2873 states. Second operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 3 states have call 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,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:06,625 INFO L93 Difference]: Finished difference Result 2873 states and 4246 transitions. [2022-04-28 15:25:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4246 transitions. [2022-04-28 15:25:06,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:06,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:06,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 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 2873 states. [2022-04-28 15:25:06,632 INFO L87 Difference]: Start difference. First operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 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 2873 states. [2022-04-28 15:25:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:06,839 INFO L93 Difference]: Finished difference Result 2873 states and 4246 transitions. [2022-04-28 15:25:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4246 transitions. [2022-04-28 15:25:06,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:06,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:06,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:06,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2868 states have (on average 1.4790794979079498) internal successors, (4242), 2868 states have internal predecessors, (4242), 3 states have call successors, (3), 3 states have call 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,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4246 transitions. [2022-04-28 15:25:07,193 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4246 transitions. Word has length 171 [2022-04-28 15:25:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:07,193 INFO L495 AbstractCegarLoop]: Abstraction has 2873 states and 4246 transitions. [2022-04-28 15:25:07,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call 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,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2873 states and 4246 transitions. [2022-04-28 15:25:11,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4246 edges. 4246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4246 transitions. [2022-04-28 15:25:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:25:11,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:11,622 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:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 15:25:11,622 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1833855140, now seen corresponding path program 1 times [2022-04-28 15:25:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918923077] [2022-04-28 15:25:11,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:25:11,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1833855140, now seen corresponding path program 2 times [2022-04-28 15:25:11,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642981779] [2022-04-28 15:25:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:11,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {159488#(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); {159482#true} is VALID [2022-04-28 15:25:11,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {159482#true} assume true; {159482#true} is VALID [2022-04-28 15:25:11,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159482#true} {159482#true} #689#return; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {159482#true} call ULTIMATE.init(); {159488#(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:11,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {159488#(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); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {159482#true} assume true; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159482#true} {159482#true} #689#return; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {159482#true} call #t~ret161 := main(); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {159482#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; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {159482#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L272 TraceCheckUtils]: 7: Hoare triple {159482#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {159482#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; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {159482#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; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {159482#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {159482#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {159482#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {159482#true} is VALID [2022-04-28 15:25:11,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {159482#true} assume !false; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {159482#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {159482#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {159482#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {159482#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {159482#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {159482#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {159482#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {159482#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {159482#true} assume 8464 == #t~mem55;havoc #t~mem55; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {159482#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; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {159482#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {159482#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {159482#true} ~skip~0 := 0; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {159482#true} assume !false; {159482#true} is VALID [2022-04-28 15:25:11,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {159482#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {159482#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {159482#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {159482#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {159482#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {159482#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {159482#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {159482#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {159482#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 42: Hoare triple {159482#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {159482#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {159482#true} assume 8496 == #t~mem58;havoc #t~mem58; {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {159482#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {159482#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 47: Hoare triple {159482#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {159482#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {159482#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {159482#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 52: Hoare triple {159482#true} ~skip~0 := 0; {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 53: Hoare triple {159482#true} assume !false; {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 54: Hoare triple {159482#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); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 55: Hoare triple {159482#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {159482#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {159482#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {159482#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 59: Hoare triple {159482#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {159482#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {159482#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 62: Hoare triple {159482#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 63: Hoare triple {159482#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 64: Hoare triple {159482#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {159482#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 66: Hoare triple {159482#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {159482#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {159482#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {159482#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {159482#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {159482#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {159482#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {159482#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {159482#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 75: Hoare triple {159482#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {159482#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {159482#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 78: Hoare triple {159482#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {159482#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {159482#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {159482#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {159482#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {159482#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {159482#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {159482#true} assume 8656 == #t~mem77;havoc #t~mem77; {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {159482#true} 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; {159482#true} is VALID [2022-04-28 15:25:11,881 INFO L290 TraceCheckUtils]: 87: Hoare triple {159482#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {159482#true} is VALID [2022-04-28 15:25:11,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {159482#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,882 INFO L290 TraceCheckUtils]: 89: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~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); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,882 INFO L290 TraceCheckUtils]: 90: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,882 INFO L290 TraceCheckUtils]: 91: Hoare triple {159487#(= 3 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); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,883 INFO L290 TraceCheckUtils]: 92: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,883 INFO L290 TraceCheckUtils]: 93: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,883 INFO L290 TraceCheckUtils]: 94: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,884 INFO L290 TraceCheckUtils]: 95: Hoare triple {159487#(= 3 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); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,884 INFO L290 TraceCheckUtils]: 96: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,884 INFO L290 TraceCheckUtils]: 97: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,885 INFO L290 TraceCheckUtils]: 98: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,885 INFO L290 TraceCheckUtils]: 99: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,885 INFO L290 TraceCheckUtils]: 100: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,885 INFO L290 TraceCheckUtils]: 101: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,886 INFO L290 TraceCheckUtils]: 102: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,886 INFO L290 TraceCheckUtils]: 103: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,886 INFO L290 TraceCheckUtils]: 104: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,887 INFO L290 TraceCheckUtils]: 106: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,887 INFO L290 TraceCheckUtils]: 107: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,887 INFO L290 TraceCheckUtils]: 108: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,888 INFO L290 TraceCheckUtils]: 110: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,888 INFO L290 TraceCheckUtils]: 111: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,888 INFO L290 TraceCheckUtils]: 112: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,889 INFO L290 TraceCheckUtils]: 113: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,889 INFO L290 TraceCheckUtils]: 114: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,889 INFO L290 TraceCheckUtils]: 115: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,890 INFO L290 TraceCheckUtils]: 116: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,890 INFO L290 TraceCheckUtils]: 117: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,890 INFO L290 TraceCheckUtils]: 118: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,891 INFO L290 TraceCheckUtils]: 119: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,891 INFO L290 TraceCheckUtils]: 120: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,891 INFO L290 TraceCheckUtils]: 121: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,891 INFO L290 TraceCheckUtils]: 122: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,892 INFO L290 TraceCheckUtils]: 123: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,892 INFO L290 TraceCheckUtils]: 124: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,892 INFO L290 TraceCheckUtils]: 125: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,892 INFO L290 TraceCheckUtils]: 126: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,893 INFO L290 TraceCheckUtils]: 127: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,893 INFO L290 TraceCheckUtils]: 128: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,893 INFO L290 TraceCheckUtils]: 129: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {159487#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 130: Hoare triple {159487#(= 3 ssl3_accept_~blastFlag~0)} assume !(3 == ~blastFlag~0); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 131: Hoare triple {159483#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); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 132: Hoare triple {159483#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; {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 133: Hoare triple {159483#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 134: Hoare triple {159483#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); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 135: Hoare triple {159483#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 136: Hoare triple {159483#false} ~skip~0 := 0; {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 137: Hoare triple {159483#false} assume !false; {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 138: Hoare triple {159483#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); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 139: Hoare triple {159483#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,894 INFO L290 TraceCheckUtils]: 140: Hoare triple {159483#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 141: Hoare triple {159483#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 142: Hoare triple {159483#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 143: Hoare triple {159483#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 144: Hoare triple {159483#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 145: Hoare triple {159483#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 146: Hoare triple {159483#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 147: Hoare triple {159483#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 148: Hoare triple {159483#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 149: Hoare triple {159483#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 150: Hoare triple {159483#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 151: Hoare triple {159483#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,895 INFO L290 TraceCheckUtils]: 152: Hoare triple {159483#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 153: Hoare triple {159483#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 154: Hoare triple {159483#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 155: Hoare triple {159483#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 156: Hoare triple {159483#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 157: Hoare triple {159483#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 158: Hoare triple {159483#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 159: Hoare triple {159483#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 160: Hoare triple {159483#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 161: Hoare triple {159483#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 162: Hoare triple {159483#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 163: Hoare triple {159483#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,896 INFO L290 TraceCheckUtils]: 164: Hoare triple {159483#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 165: Hoare triple {159483#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 166: Hoare triple {159483#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 167: Hoare triple {159483#false} assume 8640 == #t~mem75;havoc #t~mem75; {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 168: Hoare triple {159483#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 169: Hoare triple {159483#false} assume 5 == ~blastFlag~0; {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L290 TraceCheckUtils]: 170: Hoare triple {159483#false} assume !false; {159483#false} is VALID [2022-04-28 15:25:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:25:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642981779] [2022-04-28 15:25:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642981779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:11,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:11,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:11,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:11,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918923077] [2022-04-28 15:25:11,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918923077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:11,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:11,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:25:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152736230] [2022-04-28 15:25:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 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 171 [2022-04-28 15:25:11,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:11,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:11,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:25:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:11,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:25:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:25:11,995 INFO L87 Difference]: Start difference. First operand 2873 states and 4246 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:14,718 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:16,722 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:25:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:25,550 INFO L93 Difference]: Finished difference Result 6166 states and 9130 transitions. [2022-04-28 15:25:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:25:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 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 171 [2022-04-28 15:25:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:25:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-04-28 15:25:25,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 600 transitions. [2022-04-28 15:25:25,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 600 transitions. [2022-04-28 15:25:25,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:26,423 INFO L225 Difference]: With dead ends: 6166 [2022-04-28 15:25:26,423 INFO L226 Difference]: Without dead ends: 3321 [2022-04-28 15:25:26,427 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:26,427 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 139 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:25:26,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 573 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 15:25:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2022-04-28 15:25:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3321. [2022-04-28 15:25:29,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:25:29,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3321 states. Second operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 3 states have call 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:29,457 INFO L74 IsIncluded]: Start isIncluded. First operand 3321 states. Second operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 3 states have call 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:29,460 INFO L87 Difference]: Start difference. First operand 3321 states. Second operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 3 states have call 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:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:29,756 INFO L93 Difference]: Finished difference Result 3321 states and 4908 transitions. [2022-04-28 15:25:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4908 transitions. [2022-04-28 15:25:29,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:29,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:29,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 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 3321 states. [2022-04-28 15:25:29,764 INFO L87 Difference]: Start difference. First operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 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 3321 states. [2022-04-28 15:25:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:25:30,061 INFO L93 Difference]: Finished difference Result 3321 states and 4908 transitions. [2022-04-28 15:25:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4908 transitions. [2022-04-28 15:25:30,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:25:30,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:25:30,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:25:30,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:25:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3316 states have (on average 1.4788902291917974) internal successors, (4904), 3316 states have internal predecessors, (4904), 3 states have call successors, (3), 3 states have call 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:30,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 4908 transitions. [2022-04-28 15:25:30,559 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 4908 transitions. Word has length 171 [2022-04-28 15:25:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:25:30,559 INFO L495 AbstractCegarLoop]: Abstraction has 3321 states and 4908 transitions. [2022-04-28 15:25:30,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:30,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3321 states and 4908 transitions. [2022-04-28 15:25:35,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4908 edges. 4908 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 4908 transitions. [2022-04-28 15:25:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-04-28 15:25:35,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:25:35,522 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:25:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 15:25:35,522 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:25:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:25:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1110853424, now seen corresponding path program 1 times [2022-04-28 15:25:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:35,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566297094] [2022-04-28 15:25:52,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:25:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1110853424, now seen corresponding path program 2 times [2022-04-28 15:25:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:25:52,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994006761] [2022-04-28 15:25:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:25:52,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:25:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:52,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:25:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:25:52,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {185114#(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); {185107#true} is VALID [2022-04-28 15:25:52,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {185107#true} assume true; {185107#true} is VALID [2022-04-28 15:25:52,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185107#true} {185107#true} #689#return; {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {185107#true} call ULTIMATE.init(); {185114#(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:52,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {185114#(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); {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {185107#true} assume true; {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185107#true} {185107#true} #689#return; {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {185107#true} call #t~ret161 := main(); {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {185107#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L272 TraceCheckUtils]: 7: Hoare triple {185107#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {185107#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {185107#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {185107#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {185107#true} assume !false; {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {185107#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {185107#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {185107#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {185107#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {185107#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {185107#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {185107#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {185107#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {185107#true} assume 8464 == #t~mem55;havoc #t~mem55; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {185107#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {185107#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {185107#true} ~skip~0 := 0; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {185107#true} assume !false; {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {185107#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {185107#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {185107#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {185107#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {185107#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {185107#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {185107#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {185107#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {185107#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {185107#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {185107#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {185107#true} assume 8496 == #t~mem58;havoc #t~mem58; {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {185107#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {185107#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {185107#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {185107#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {185107#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {185107#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {185107#true} ~skip~0 := 0; {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {185107#true} assume !false; {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {185107#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {185107#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {185107#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {185107#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {185107#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {185107#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {185107#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {185107#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 63: Hoare triple {185107#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 64: Hoare triple {185107#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {185107#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {185107#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {185107#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 68: Hoare triple {185107#true} assume 8512 == #t~mem60;havoc #t~mem60; {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 69: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 70: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 71: Hoare triple {185107#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 72: Hoare triple {185107#true} assume !(~ret~0 <= 0); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 73: Hoare triple {185107#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 74: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {185107#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185107#true} is VALID [2022-04-28 15:25:52,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {185107#true} ~skip~0 := 0; {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 77: Hoare triple {185107#true} assume !false; {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 78: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 79: Hoare triple {185107#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 80: Hoare triple {185107#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 81: Hoare triple {185107#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 82: Hoare triple {185107#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 83: Hoare triple {185107#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 84: Hoare triple {185107#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {185107#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 86: Hoare triple {185107#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 87: Hoare triple {185107#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {185107#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {185107#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 90: Hoare triple {185107#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 91: Hoare triple {185107#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 92: Hoare triple {185107#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 93: Hoare triple {185107#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 94: Hoare triple {185107#true} assume 8528 == #t~mem62;havoc #t~mem62; {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 95: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 96: Hoare triple {185107#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; {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 97: Hoare triple {185107#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); {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 98: Hoare triple {185107#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 99: Hoare triple {185107#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 100: Hoare triple {185107#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {185107#true} is VALID [2022-04-28 15:25:52,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {185107#true} assume !(~ret~0 <= 0); {185107#true} is VALID [2022-04-28 15:25:52,611 INFO L290 TraceCheckUtils]: 102: Hoare triple {185107#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,612 INFO L290 TraceCheckUtils]: 103: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,612 INFO L290 TraceCheckUtils]: 104: Hoare triple {185112#(not (= 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; {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,613 INFO L290 TraceCheckUtils]: 105: Hoare triple {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,613 INFO L290 TraceCheckUtils]: 106: Hoare triple {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,613 INFO L290 TraceCheckUtils]: 107: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,614 INFO L290 TraceCheckUtils]: 108: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,614 INFO L290 TraceCheckUtils]: 109: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,615 INFO L290 TraceCheckUtils]: 110: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,615 INFO L290 TraceCheckUtils]: 111: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,615 INFO L290 TraceCheckUtils]: 112: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,616 INFO L290 TraceCheckUtils]: 113: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,616 INFO L290 TraceCheckUtils]: 114: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,617 INFO L290 TraceCheckUtils]: 115: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,617 INFO L290 TraceCheckUtils]: 116: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,618 INFO L290 TraceCheckUtils]: 118: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,618 INFO L290 TraceCheckUtils]: 119: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,619 INFO L290 TraceCheckUtils]: 120: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,619 INFO L290 TraceCheckUtils]: 121: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,620 INFO L290 TraceCheckUtils]: 122: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,620 INFO L290 TraceCheckUtils]: 123: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,620 INFO L290 TraceCheckUtils]: 124: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,621 INFO L290 TraceCheckUtils]: 125: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,621 INFO L290 TraceCheckUtils]: 126: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,622 INFO L290 TraceCheckUtils]: 127: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,622 INFO L290 TraceCheckUtils]: 128: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,622 INFO L290 TraceCheckUtils]: 129: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,623 INFO L290 TraceCheckUtils]: 130: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,623 INFO L290 TraceCheckUtils]: 131: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,624 INFO L290 TraceCheckUtils]: 132: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,624 INFO L290 TraceCheckUtils]: 133: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,624 INFO L290 TraceCheckUtils]: 134: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,625 INFO L290 TraceCheckUtils]: 135: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,625 INFO L290 TraceCheckUtils]: 136: Hoare triple {185112#(not (= 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); {185112#(not (= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 137: Hoare triple {185112#(not (= 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); {185113#(not (= |ssl3_accept_#t~mem77| 8656))} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 138: Hoare triple {185113#(not (= |ssl3_accept_#t~mem77| 8656))} assume 8656 == #t~mem77;havoc #t~mem77; {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 139: Hoare triple {185108#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; {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 140: Hoare triple {185108#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 141: Hoare triple {185108#false} assume !(2 == ~blastFlag~0); {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 142: Hoare triple {185108#false} assume !(4 == ~blastFlag~0); {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 143: Hoare triple {185108#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 144: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,626 INFO L290 TraceCheckUtils]: 145: Hoare triple {185108#false} assume !(0 == ~tmp___10~0); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 146: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 147: Hoare triple {185108#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 148: Hoare triple {185108#false} ~skip~0 := 0; {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 149: Hoare triple {185108#false} assume !false; {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 150: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 151: Hoare triple {185108#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 152: Hoare triple {185108#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 153: Hoare triple {185108#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 154: Hoare triple {185108#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 155: Hoare triple {185108#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 156: Hoare triple {185108#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 157: Hoare triple {185108#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,627 INFO L290 TraceCheckUtils]: 158: Hoare triple {185108#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 159: Hoare triple {185108#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 160: Hoare triple {185108#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 161: Hoare triple {185108#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 162: Hoare triple {185108#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 163: Hoare triple {185108#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 164: Hoare triple {185108#false} assume 8512 == #t~mem60;havoc #t~mem60; {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 165: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 166: Hoare triple {185108#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; {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 167: Hoare triple {185108#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 168: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 169: Hoare triple {185108#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 170: Hoare triple {185108#false} ~skip~0 := 0; {185108#false} is VALID [2022-04-28 15:25:52,628 INFO L290 TraceCheckUtils]: 171: Hoare triple {185108#false} assume !false; {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 172: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 173: Hoare triple {185108#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 174: Hoare triple {185108#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 175: Hoare triple {185108#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 176: Hoare triple {185108#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 177: Hoare triple {185108#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 178: Hoare triple {185108#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 179: Hoare triple {185108#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 180: Hoare triple {185108#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 181: Hoare triple {185108#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 182: Hoare triple {185108#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 183: Hoare triple {185108#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,629 INFO L290 TraceCheckUtils]: 184: Hoare triple {185108#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 185: Hoare triple {185108#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 186: Hoare triple {185108#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 187: Hoare triple {185108#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 188: Hoare triple {185108#false} assume 8528 == #t~mem62;havoc #t~mem62; {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 189: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 190: Hoare triple {185108#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; {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 191: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 192: Hoare triple {185108#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 193: Hoare triple {185108#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 194: Hoare triple {185108#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 195: Hoare triple {185108#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,630 INFO L290 TraceCheckUtils]: 196: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 197: Hoare triple {185108#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 198: Hoare triple {185108#false} ~skip~0 := 0; {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 199: Hoare triple {185108#false} assume !false; {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 200: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 201: Hoare triple {185108#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 202: Hoare triple {185108#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 203: Hoare triple {185108#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 204: Hoare triple {185108#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 205: Hoare triple {185108#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 206: Hoare triple {185108#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 207: Hoare triple {185108#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 208: Hoare triple {185108#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,631 INFO L290 TraceCheckUtils]: 209: Hoare triple {185108#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 210: Hoare triple {185108#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 211: Hoare triple {185108#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 212: Hoare triple {185108#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 213: Hoare triple {185108#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 214: Hoare triple {185108#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 215: Hoare triple {185108#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 216: Hoare triple {185108#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 217: Hoare triple {185108#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 218: Hoare triple {185108#false} assume 8544 == #t~mem64;havoc #t~mem64; {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 219: Hoare triple {185108#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 220: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 221: Hoare triple {185108#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {185108#false} is VALID [2022-04-28 15:25:52,632 INFO L290 TraceCheckUtils]: 222: Hoare triple {185108#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); {185108#false} is VALID [2022-04-28 15:25:52,633 INFO L290 TraceCheckUtils]: 223: Hoare triple {185108#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; {185108#false} is VALID [2022-04-28 15:25:52,633 INFO L290 TraceCheckUtils]: 224: Hoare triple {185108#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; {185108#false} is VALID [2022-04-28 15:25:52,633 INFO L290 TraceCheckUtils]: 225: Hoare triple {185108#false} assume 8 == ~blastFlag~0; {185108#false} is VALID [2022-04-28 15:25:52,633 INFO L290 TraceCheckUtils]: 226: Hoare triple {185108#false} assume !false; {185108#false} is VALID [2022-04-28 15:25:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:25:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:25:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994006761] [2022-04-28 15:25:52,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994006761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:52,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:52,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:52,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:25:52,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566297094] [2022-04-28 15:25:52,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566297094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:25:52,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:25:52,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:25:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265570763] [2022-04-28 15:25:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:25:52,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 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 227 [2022-04-28 15:25:52,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:25:52,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:52,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:25:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:25:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:25:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:25:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:25:52,731 INFO L87 Difference]: Start difference. First operand 3321 states and 4908 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:56,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:25:59,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:02,892 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:26:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:09,951 INFO L93 Difference]: Finished difference Result 7057 states and 10377 transitions. [2022-04-28 15:26:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 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 227 [2022-04-28 15:26:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:26:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:26:09,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-28 15:26:10,343 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:26:10,951 INFO L225 Difference]: With dead ends: 7057 [2022-04-28 15:26:10,951 INFO L226 Difference]: Without dead ends: 3764 [2022-04-28 15:26:10,955 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:26:10,955 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 102 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:10,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 445 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:26:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-04-28 15:26:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3326. [2022-04-28 15:26:14,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:14,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3764 states. Second operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 3 states have call 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:14,049 INFO L74 IsIncluded]: Start isIncluded. First operand 3764 states. Second operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 3 states have call 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:14,052 INFO L87 Difference]: Start difference. First operand 3764 states. Second operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 3 states have call 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:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:14,430 INFO L93 Difference]: Finished difference Result 3764 states and 5489 transitions. [2022-04-28 15:26:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5489 transitions. [2022-04-28 15:26:14,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:14,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:14,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:26:14,441 INFO L87 Difference]: Start difference. First operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:26:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:14,814 INFO L93 Difference]: Finished difference Result 3764 states and 5489 transitions. [2022-04-28 15:26:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5489 transitions. [2022-04-28 15:26:14,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:14,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:14,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:14,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3326 states, 3321 states have (on average 1.4760614272809396) internal successors, (4902), 3321 states have internal predecessors, (4902), 3 states have call successors, (3), 3 states have call 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:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 4906 transitions. [2022-04-28 15:26:15,310 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 4906 transitions. Word has length 227 [2022-04-28 15:26:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:15,310 INFO L495 AbstractCegarLoop]: Abstraction has 3326 states and 4906 transitions. [2022-04-28 15:26:15,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call 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:15,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3326 states and 4906 transitions. [2022-04-28 15:26:20,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4906 edges. 4906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 4906 transitions. [2022-04-28 15:26:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-04-28 15:26:20,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:20,535 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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, 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:20,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 15:26:20,536 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2066791628, now seen corresponding path program 1 times [2022-04-28 15:26:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:20,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [671049285] [2022-04-28 15:26:37,420 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:26:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2066791628, now seen corresponding path program 2 times [2022-04-28 15:26:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:37,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982374030] [2022-04-28 15:26:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:37,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {213420#(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); {213413#true} is VALID [2022-04-28 15:26:37,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {213413#true} assume true; {213413#true} is VALID [2022-04-28 15:26:37,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213413#true} {213413#true} #689#return; {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {213413#true} call ULTIMATE.init(); {213420#(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:37,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {213420#(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); {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {213413#true} assume true; {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213413#true} {213413#true} #689#return; {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {213413#true} call #t~ret161 := main(); {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {213413#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L272 TraceCheckUtils]: 7: Hoare triple {213413#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {213413#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {213413#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {213413#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {213413#true} assume !false; {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {213413#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {213413#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {213413#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {213413#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {213413#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {213413#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {213413#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {213413#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {213413#true} assume 8464 == #t~mem55;havoc #t~mem55; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {213413#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {213413#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {213413#true} ~skip~0 := 0; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {213413#true} assume !false; {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {213413#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 34: Hoare triple {213413#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 35: Hoare triple {213413#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,587 INFO L290 TraceCheckUtils]: 36: Hoare triple {213413#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 37: Hoare triple {213413#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 38: Hoare triple {213413#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {213413#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 40: Hoare triple {213413#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {213413#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {213413#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {213413#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {213413#true} assume 8496 == #t~mem58;havoc #t~mem58; {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {213413#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {213413#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {213413#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {213413#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {213413#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 51: Hoare triple {213413#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {213413#true} ~skip~0 := 0; {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {213413#true} assume !false; {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {213413#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {213413#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {213413#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 58: Hoare triple {213413#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {213413#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {213413#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {213413#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 62: Hoare triple {213413#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,589 INFO L290 TraceCheckUtils]: 63: Hoare triple {213413#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 64: Hoare triple {213413#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 65: Hoare triple {213413#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 66: Hoare triple {213413#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 67: Hoare triple {213413#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 68: Hoare triple {213413#true} assume 8512 == #t~mem60;havoc #t~mem60; {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {213413#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {213413#true} assume !(~ret~0 <= 0); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {213413#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 75: Hoare triple {213413#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213413#true} is VALID [2022-04-28 15:26:37,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {213413#true} ~skip~0 := 0; {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {213413#true} assume !false; {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 78: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 79: Hoare triple {213413#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 80: Hoare triple {213413#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 81: Hoare triple {213413#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 82: Hoare triple {213413#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 83: Hoare triple {213413#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 84: Hoare triple {213413#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 85: Hoare triple {213413#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 86: Hoare triple {213413#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 87: Hoare triple {213413#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {213413#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {213413#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,591 INFO L290 TraceCheckUtils]: 90: Hoare triple {213413#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {213413#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {213413#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {213413#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 94: Hoare triple {213413#true} assume 8528 == #t~mem62;havoc #t~mem62; {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 95: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 96: Hoare triple {213413#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; {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 97: Hoare triple {213413#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); {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 98: Hoare triple {213413#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 99: Hoare triple {213413#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 100: Hoare triple {213413#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {213413#true} is VALID [2022-04-28 15:26:37,592 INFO L290 TraceCheckUtils]: 101: Hoare triple {213413#true} assume !(~ret~0 <= 0); {213413#true} is VALID [2022-04-28 15:26:37,593 INFO L290 TraceCheckUtils]: 102: Hoare triple {213413#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,594 INFO L290 TraceCheckUtils]: 103: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,594 INFO L290 TraceCheckUtils]: 104: Hoare triple {213418#(not (= 8657 (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; {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,595 INFO L290 TraceCheckUtils]: 105: Hoare triple {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,595 INFO L290 TraceCheckUtils]: 106: Hoare triple {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,595 INFO L290 TraceCheckUtils]: 107: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,596 INFO L290 TraceCheckUtils]: 108: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,596 INFO L290 TraceCheckUtils]: 109: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,597 INFO L290 TraceCheckUtils]: 110: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,597 INFO L290 TraceCheckUtils]: 111: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,597 INFO L290 TraceCheckUtils]: 112: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,598 INFO L290 TraceCheckUtils]: 113: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,598 INFO L290 TraceCheckUtils]: 114: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,599 INFO L290 TraceCheckUtils]: 115: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,599 INFO L290 TraceCheckUtils]: 116: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,599 INFO L290 TraceCheckUtils]: 117: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,600 INFO L290 TraceCheckUtils]: 119: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,601 INFO L290 TraceCheckUtils]: 122: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,602 INFO L290 TraceCheckUtils]: 124: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,603 INFO L290 TraceCheckUtils]: 127: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,604 INFO L290 TraceCheckUtils]: 128: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,604 INFO L290 TraceCheckUtils]: 129: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,605 INFO L290 TraceCheckUtils]: 130: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,605 INFO L290 TraceCheckUtils]: 131: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,605 INFO L290 TraceCheckUtils]: 132: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,606 INFO L290 TraceCheckUtils]: 133: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,606 INFO L290 TraceCheckUtils]: 134: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,607 INFO L290 TraceCheckUtils]: 135: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,607 INFO L290 TraceCheckUtils]: 136: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,607 INFO L290 TraceCheckUtils]: 137: Hoare triple {213418#(not (= 8657 (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); {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 138: Hoare triple {213418#(not (= 8657 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {213419#(not (= |ssl3_accept_#t~mem78| 8657))} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 139: Hoare triple {213419#(not (= |ssl3_accept_#t~mem78| 8657))} assume 8657 == #t~mem78;havoc #t~mem78; {213414#false} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 140: Hoare triple {213414#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; {213414#false} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 141: Hoare triple {213414#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {213414#false} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 142: Hoare triple {213414#false} assume !(2 == ~blastFlag~0); {213414#false} is VALID [2022-04-28 15:26:37,608 INFO L290 TraceCheckUtils]: 143: Hoare triple {213414#false} assume !(4 == ~blastFlag~0); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 144: Hoare triple {213414#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 145: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 146: Hoare triple {213414#false} assume !(0 == ~tmp___10~0); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 147: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 148: Hoare triple {213414#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 149: Hoare triple {213414#false} ~skip~0 := 0; {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 150: Hoare triple {213414#false} assume !false; {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 151: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 152: Hoare triple {213414#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 153: Hoare triple {213414#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 154: Hoare triple {213414#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 155: Hoare triple {213414#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,609 INFO L290 TraceCheckUtils]: 156: Hoare triple {213414#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 157: Hoare triple {213414#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 158: Hoare triple {213414#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 159: Hoare triple {213414#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 160: Hoare triple {213414#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 161: Hoare triple {213414#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 162: Hoare triple {213414#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 163: Hoare triple {213414#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 164: Hoare triple {213414#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 165: Hoare triple {213414#false} assume 8512 == #t~mem60;havoc #t~mem60; {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 166: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 167: Hoare triple {213414#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; {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 168: Hoare triple {213414#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,610 INFO L290 TraceCheckUtils]: 169: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 170: Hoare triple {213414#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 171: Hoare triple {213414#false} ~skip~0 := 0; {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 172: Hoare triple {213414#false} assume !false; {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 173: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 174: Hoare triple {213414#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 175: Hoare triple {213414#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 176: Hoare triple {213414#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 177: Hoare triple {213414#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 178: Hoare triple {213414#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 179: Hoare triple {213414#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 180: Hoare triple {213414#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 181: Hoare triple {213414#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,611 INFO L290 TraceCheckUtils]: 182: Hoare triple {213414#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 183: Hoare triple {213414#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 184: Hoare triple {213414#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 185: Hoare triple {213414#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 186: Hoare triple {213414#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 187: Hoare triple {213414#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 188: Hoare triple {213414#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 189: Hoare triple {213414#false} assume 8528 == #t~mem62;havoc #t~mem62; {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 190: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 191: Hoare triple {213414#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; {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 192: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 193: Hoare triple {213414#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 194: Hoare triple {213414#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 195: Hoare triple {213414#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {213414#false} is VALID [2022-04-28 15:26:37,612 INFO L290 TraceCheckUtils]: 196: Hoare triple {213414#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 197: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 198: Hoare triple {213414#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 199: Hoare triple {213414#false} ~skip~0 := 0; {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 200: Hoare triple {213414#false} assume !false; {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 201: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 202: Hoare triple {213414#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 203: Hoare triple {213414#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 204: Hoare triple {213414#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 205: Hoare triple {213414#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 206: Hoare triple {213414#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 207: Hoare triple {213414#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 208: Hoare triple {213414#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,613 INFO L290 TraceCheckUtils]: 209: Hoare triple {213414#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 210: Hoare triple {213414#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 211: Hoare triple {213414#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 212: Hoare triple {213414#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 213: Hoare triple {213414#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 214: Hoare triple {213414#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 215: Hoare triple {213414#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 216: Hoare triple {213414#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 217: Hoare triple {213414#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 218: Hoare triple {213414#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 219: Hoare triple {213414#false} assume 8544 == #t~mem64;havoc #t~mem64; {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 220: Hoare triple {213414#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 221: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 222: Hoare triple {213414#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {213414#false} is VALID [2022-04-28 15:26:37,614 INFO L290 TraceCheckUtils]: 223: Hoare triple {213414#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); {213414#false} is VALID [2022-04-28 15:26:37,615 INFO L290 TraceCheckUtils]: 224: Hoare triple {213414#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; {213414#false} is VALID [2022-04-28 15:26:37,615 INFO L290 TraceCheckUtils]: 225: Hoare triple {213414#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; {213414#false} is VALID [2022-04-28 15:26:37,615 INFO L290 TraceCheckUtils]: 226: Hoare triple {213414#false} assume 8 == ~blastFlag~0; {213414#false} is VALID [2022-04-28 15:26:37,615 INFO L290 TraceCheckUtils]: 227: Hoare triple {213414#false} assume !false; {213414#false} is VALID [2022-04-28 15:26:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-28 15:26:37,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982374030] [2022-04-28 15:26:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982374030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:37,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:37,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:37,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:37,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [671049285] [2022-04-28 15:26:37,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [671049285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:37,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:37,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418034146] [2022-04-28 15:26:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:37,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 228 [2022-04-28 15:26:37,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:37,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call 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:37,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:37,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:37,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:37,723 INFO L87 Difference]: Start difference. First operand 3326 states and 4906 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call 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:40,202 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:26:42,217 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:26:44,242 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:26:46,954 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:26:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:53,751 INFO L93 Difference]: Finished difference Result 7062 states and 10363 transitions. [2022-04-28 15:26:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:53,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 228 [2022-04-28 15:26:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call 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:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:26:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call 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:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-28 15:26:53,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-28 15:26:54,126 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:26:54,726 INFO L225 Difference]: With dead ends: 7062 [2022-04-28 15:26:54,727 INFO L226 Difference]: Without dead ends: 3764 [2022-04-28 15:26:54,730 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:26:54,731 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 101 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:54,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 364 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 462 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:26:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-04-28 15:26:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3331. [2022-04-28 15:26:57,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:57,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 3 states have call 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:57,799 INFO L74 IsIncluded]: Start isIncluded. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 3 states have call 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:57,802 INFO L87 Difference]: Start difference. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 3 states have call 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:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:58,172 INFO L93 Difference]: Finished difference Result 3764 states and 5477 transitions. [2022-04-28 15:26:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5477 transitions. [2022-04-28 15:26:58,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:58,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:58,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:26:58,181 INFO L87 Difference]: Start difference. First operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:26:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:58,548 INFO L93 Difference]: Finished difference Result 3764 states and 5477 transitions. [2022-04-28 15:26:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5477 transitions. [2022-04-28 15:26:58,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:58,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:58,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:58,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3326 states have (on average 1.4732411304870716) internal successors, (4900), 3326 states have internal predecessors, (4900), 3 states have call successors, (3), 3 states have call 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:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4904 transitions. [2022-04-28 15:26:59,057 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4904 transitions. Word has length 228 [2022-04-28 15:26:59,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:59,057 INFO L495 AbstractCegarLoop]: Abstraction has 3331 states and 4904 transitions. [2022-04-28 15:26:59,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call 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:59,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3331 states and 4904 transitions. [2022-04-28 15:27:04,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4904 edges. 4904 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4904 transitions. [2022-04-28 15:27:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-04-28 15:27:04,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:04,403 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:04,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 15:27:04,403 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1642475385, now seen corresponding path program 1 times [2022-04-28 15:27:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:04,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [681767592] [2022-04-28 15:27:22,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1642475385, now seen corresponding path program 2 times [2022-04-28 15:27:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:22,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416486240] [2022-04-28 15:27:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:22,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {241746#(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); {241739#true} is VALID [2022-04-28 15:27:22,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {241739#true} assume true; {241739#true} is VALID [2022-04-28 15:27:22,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241739#true} {241739#true} #689#return; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {241739#true} call ULTIMATE.init(); {241746#(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:27:22,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {241746#(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); {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {241739#true} assume true; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241739#true} {241739#true} #689#return; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {241739#true} call #t~ret161 := main(); {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {241739#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {241739#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {241739#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {241739#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {241739#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {241739#true} assume !false; {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {241739#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {241739#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {241739#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {241739#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {241739#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {241739#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {241739#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {241739#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {241739#true} assume 8464 == #t~mem55;havoc #t~mem55; {241739#true} is VALID [2022-04-28 15:27:22,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {241739#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {241739#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {241739#true} ~skip~0 := 0; {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {241739#true} assume !false; {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {241739#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {241739#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {241739#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {241739#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {241739#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {241739#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {241739#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {241739#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {241739#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {241739#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {241739#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {241739#true} assume 8496 == #t~mem58;havoc #t~mem58; {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {241739#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {241739#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {241739#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {241739#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {241739#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 51: Hoare triple {241739#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 52: Hoare triple {241739#true} ~skip~0 := 0; {241739#true} is VALID [2022-04-28 15:27:22,572 INFO L290 TraceCheckUtils]: 53: Hoare triple {241739#true} assume !false; {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 54: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 55: Hoare triple {241739#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 56: Hoare triple {241739#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {241739#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 58: Hoare triple {241739#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 59: Hoare triple {241739#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 60: Hoare triple {241739#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {241739#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {241739#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {241739#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 64: Hoare triple {241739#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 65: Hoare triple {241739#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {241739#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {241739#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {241739#true} assume 8512 == #t~mem60;havoc #t~mem60; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {241739#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {241739#true} assume !(~ret~0 <= 0); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 73: Hoare triple {241739#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 74: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 75: Hoare triple {241739#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 76: Hoare triple {241739#true} ~skip~0 := 0; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 77: Hoare triple {241739#true} assume !false; {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 78: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 79: Hoare triple {241739#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 80: Hoare triple {241739#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {241739#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {241739#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {241739#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {241739#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {241739#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {241739#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {241739#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {241739#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 89: Hoare triple {241739#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 90: Hoare triple {241739#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 91: Hoare triple {241739#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 92: Hoare triple {241739#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 93: Hoare triple {241739#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {241739#true} is VALID [2022-04-28 15:27:22,575 INFO L290 TraceCheckUtils]: 94: Hoare triple {241739#true} assume 8528 == #t~mem62;havoc #t~mem62; {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 95: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {241739#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; {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {241739#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); {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 98: Hoare triple {241739#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 99: Hoare triple {241739#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 100: Hoare triple {241739#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {241739#true} is VALID [2022-04-28 15:27:22,576 INFO L290 TraceCheckUtils]: 101: Hoare triple {241739#true} assume !(~ret~0 <= 0); {241739#true} is VALID [2022-04-28 15:27:22,577 INFO L290 TraceCheckUtils]: 102: Hoare triple {241739#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,578 INFO L290 TraceCheckUtils]: 103: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,578 INFO L290 TraceCheckUtils]: 104: Hoare triple {241744#(not (= 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; {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,578 INFO L290 TraceCheckUtils]: 105: Hoare triple {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,579 INFO L290 TraceCheckUtils]: 106: Hoare triple {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,579 INFO L290 TraceCheckUtils]: 107: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,580 INFO L290 TraceCheckUtils]: 108: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,580 INFO L290 TraceCheckUtils]: 109: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,580 INFO L290 TraceCheckUtils]: 110: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,581 INFO L290 TraceCheckUtils]: 111: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,581 INFO L290 TraceCheckUtils]: 112: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,581 INFO L290 TraceCheckUtils]: 113: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,582 INFO L290 TraceCheckUtils]: 114: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,582 INFO L290 TraceCheckUtils]: 115: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,583 INFO L290 TraceCheckUtils]: 116: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,583 INFO L290 TraceCheckUtils]: 117: Hoare triple {241744#(not (= 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); {241744#(not (= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:22,583 INFO L290 TraceCheckUtils]: 118: Hoare triple {241744#(not (= 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); {241745#(not (= |ssl3_accept_#t~mem58| 8496))} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 119: Hoare triple {241745#(not (= |ssl3_accept_#t~mem58| 8496))} assume 8496 == #t~mem58;havoc #t~mem58; {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 120: Hoare triple {241740#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 121: Hoare triple {241740#false} assume !(1 == ~blastFlag~0); {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 122: Hoare triple {241740#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 123: Hoare triple {241740#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 124: Hoare triple {241740#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 125: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 126: Hoare triple {241740#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 127: Hoare triple {241740#false} ~skip~0 := 0; {241740#false} is VALID [2022-04-28 15:27:22,584 INFO L290 TraceCheckUtils]: 128: Hoare triple {241740#false} assume !false; {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 129: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 130: Hoare triple {241740#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 131: Hoare triple {241740#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 132: Hoare triple {241740#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 133: Hoare triple {241740#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 134: Hoare triple {241740#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 135: Hoare triple {241740#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 136: Hoare triple {241740#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 137: Hoare triple {241740#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 138: Hoare triple {241740#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 139: Hoare triple {241740#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 140: Hoare triple {241740#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 141: Hoare triple {241740#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,585 INFO L290 TraceCheckUtils]: 142: Hoare triple {241740#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 143: Hoare triple {241740#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 144: Hoare triple {241740#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 145: Hoare triple {241740#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 146: Hoare triple {241740#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 147: Hoare triple {241740#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 148: Hoare triple {241740#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 149: Hoare triple {241740#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 150: Hoare triple {241740#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 151: Hoare triple {241740#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 152: Hoare triple {241740#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 153: Hoare triple {241740#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 154: Hoare triple {241740#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,586 INFO L290 TraceCheckUtils]: 155: Hoare triple {241740#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 156: Hoare triple {241740#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 157: Hoare triple {241740#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 158: Hoare triple {241740#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 159: Hoare triple {241740#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 160: Hoare triple {241740#false} assume 8656 == #t~mem77;havoc #t~mem77; {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 161: Hoare triple {241740#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; {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 162: Hoare triple {241740#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 163: Hoare triple {241740#false} assume !(2 == ~blastFlag~0); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 164: Hoare triple {241740#false} assume !(4 == ~blastFlag~0); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 165: Hoare triple {241740#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 166: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 167: Hoare triple {241740#false} assume !(0 == ~tmp___10~0); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 168: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,587 INFO L290 TraceCheckUtils]: 169: Hoare triple {241740#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 170: Hoare triple {241740#false} ~skip~0 := 0; {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 171: Hoare triple {241740#false} assume !false; {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 172: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 173: Hoare triple {241740#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 174: Hoare triple {241740#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 175: Hoare triple {241740#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 176: Hoare triple {241740#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 177: Hoare triple {241740#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 178: Hoare triple {241740#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 179: Hoare triple {241740#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 180: Hoare triple {241740#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 181: Hoare triple {241740#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 182: Hoare triple {241740#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 183: Hoare triple {241740#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,588 INFO L290 TraceCheckUtils]: 184: Hoare triple {241740#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 185: Hoare triple {241740#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 186: Hoare triple {241740#false} assume 8512 == #t~mem60;havoc #t~mem60; {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 187: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 188: Hoare triple {241740#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; {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 189: Hoare triple {241740#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 190: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 191: Hoare triple {241740#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 192: Hoare triple {241740#false} ~skip~0 := 0; {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 193: Hoare triple {241740#false} assume !false; {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 194: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 195: Hoare triple {241740#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,589 INFO L290 TraceCheckUtils]: 196: Hoare triple {241740#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 197: Hoare triple {241740#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 198: Hoare triple {241740#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 199: Hoare triple {241740#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 200: Hoare triple {241740#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 201: Hoare triple {241740#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 202: Hoare triple {241740#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 203: Hoare triple {241740#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 204: Hoare triple {241740#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 205: Hoare triple {241740#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 206: Hoare triple {241740#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 207: Hoare triple {241740#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 208: Hoare triple {241740#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 209: Hoare triple {241740#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,590 INFO L290 TraceCheckUtils]: 210: Hoare triple {241740#false} assume 8528 == #t~mem62;havoc #t~mem62; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 211: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 212: Hoare triple {241740#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; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 213: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 214: Hoare triple {241740#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 215: Hoare triple {241740#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 216: Hoare triple {241740#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 217: Hoare triple {241740#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 218: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 219: Hoare triple {241740#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 220: Hoare triple {241740#false} ~skip~0 := 0; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 221: Hoare triple {241740#false} assume !false; {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 222: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,591 INFO L290 TraceCheckUtils]: 223: Hoare triple {241740#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 224: Hoare triple {241740#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 225: Hoare triple {241740#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 226: Hoare triple {241740#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 227: Hoare triple {241740#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 228: Hoare triple {241740#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 229: Hoare triple {241740#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 230: Hoare triple {241740#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 231: Hoare triple {241740#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 232: Hoare triple {241740#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 233: Hoare triple {241740#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 234: Hoare triple {241740#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 235: Hoare triple {241740#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 236: Hoare triple {241740#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,592 INFO L290 TraceCheckUtils]: 237: Hoare triple {241740#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 238: Hoare triple {241740#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 239: Hoare triple {241740#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 240: Hoare triple {241740#false} assume 8544 == #t~mem64;havoc #t~mem64; {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 241: Hoare triple {241740#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 242: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 243: Hoare triple {241740#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 244: Hoare triple {241740#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); {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 245: Hoare triple {241740#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; {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 246: Hoare triple {241740#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; {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 247: Hoare triple {241740#false} assume 8 == ~blastFlag~0; {241740#false} is VALID [2022-04-28 15:27:22,593 INFO L290 TraceCheckUtils]: 248: Hoare triple {241740#false} assume !false; {241740#false} is VALID [2022-04-28 15:27:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-04-28 15:27:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:22,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416486240] [2022-04-28 15:27:22,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416486240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:22,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:22,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:22,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:22,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [681767592] [2022-04-28 15:27:22,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [681767592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:22,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:22,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591473108] [2022-04-28 15:27:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:22,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 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 249 [2022-04-28 15:27:22,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:22,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:22,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:22,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:22,705 INFO L87 Difference]: Start difference. First operand 3331 states and 4904 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:25,984 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:27:27,988 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:27:32,995 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:27:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:39,877 INFO L93 Difference]: Finished difference Result 7067 states and 10349 transitions. [2022-04-28 15:27:39,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:39,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 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 249 [2022-04-28 15:27:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2022-04-28 15:27:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2022-04-28 15:27:39,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 568 transitions. [2022-04-28 15:27:40,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:40,885 INFO L225 Difference]: With dead ends: 7067 [2022-04-28 15:27:40,885 INFO L226 Difference]: Without dead ends: 3764 [2022-04-28 15:27:40,888 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:27:40,889 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 120 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:40,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 411 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 487 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-28 15:27:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-04-28 15:27:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3331. [2022-04-28 15:27:44,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:44,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:44,010 INFO L74 IsIncluded]: Start isIncluded. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:44,014 INFO L87 Difference]: Start difference. First operand 3764 states. Second operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:44,387 INFO L93 Difference]: Finished difference Result 3764 states and 5417 transitions. [2022-04-28 15:27:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5417 transitions. [2022-04-28 15:27:44,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:44,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:44,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:27:44,400 INFO L87 Difference]: Start difference. First operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:27:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:44,775 INFO L93 Difference]: Finished difference Result 3764 states and 5417 transitions. [2022-04-28 15:27:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5417 transitions. [2022-04-28 15:27:44,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:44,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:44,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:44,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3326 states have (on average 1.455201443174985) internal successors, (4840), 3326 states have internal predecessors, (4840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4844 transitions. [2022-04-28 15:27:45,280 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4844 transitions. Word has length 249 [2022-04-28 15:27:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:45,280 INFO L495 AbstractCegarLoop]: Abstraction has 3331 states and 4844 transitions. [2022-04-28 15:27:45,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:45,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3331 states and 4844 transitions. [2022-04-28 15:27:50,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4844 edges. 4844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4844 transitions. [2022-04-28 15:27:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-04-28 15:27:50,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:50,747 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:50,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 15:27:50,747 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:50,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash -635268912, now seen corresponding path program 1 times [2022-04-28 15:27:50,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:50,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154722215] [2022-04-28 15:28:08,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -635268912, now seen corresponding path program 2 times [2022-04-28 15:28:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:08,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612893310] [2022-04-28 15:28:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:09,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:09,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {270082#(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); {270075#true} is VALID [2022-04-28 15:28:09,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {270075#true} assume true; {270075#true} is VALID [2022-04-28 15:28:09,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {270075#true} {270075#true} #689#return; {270075#true} is VALID [2022-04-28 15:28:09,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {270075#true} call ULTIMATE.init(); {270082#(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:28:09,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {270082#(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); {270075#true} is VALID [2022-04-28 15:28:09,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {270075#true} assume true; {270075#true} is VALID [2022-04-28 15:28:09,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {270075#true} {270075#true} #689#return; {270075#true} is VALID [2022-04-28 15:28:09,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {270075#true} call #t~ret161 := main(); {270075#true} is VALID [2022-04-28 15:28:09,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {270075#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L272 TraceCheckUtils]: 7: Hoare triple {270075#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {270075#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {270075#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {270075#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {270075#true} assume !false; {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {270075#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {270075#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {270075#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {270075#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {270075#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {270075#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {270075#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {270075#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {270075#true} assume 8464 == #t~mem55;havoc #t~mem55; {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {270075#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {270075#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {270075#true} ~skip~0 := 0; {270075#true} is VALID [2022-04-28 15:28:09,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {270075#true} assume !false; {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {270075#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {270075#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {270075#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {270075#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {270075#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {270075#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {270075#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {270075#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {270075#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {270075#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {270075#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {270075#true} assume 8496 == #t~mem58;havoc #t~mem58; {270075#true} is VALID [2022-04-28 15:28:09,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {270075#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {270075#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 47: Hoare triple {270075#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {270075#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {270075#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {270075#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {270075#true} ~skip~0 := 0; {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {270075#true} assume !false; {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 54: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {270075#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {270075#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {270075#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {270075#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {270075#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {270075#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {270075#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {270075#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {270075#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {270075#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {270075#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {270075#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {270075#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 68: Hoare triple {270075#true} assume 8512 == #t~mem60;havoc #t~mem60; {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 69: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 70: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 71: Hoare triple {270075#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {270075#true} is VALID [2022-04-28 15:28:09,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {270075#true} assume !(~ret~0 <= 0); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 73: Hoare triple {270075#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 74: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 75: Hoare triple {270075#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 76: Hoare triple {270075#true} ~skip~0 := 0; {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 77: Hoare triple {270075#true} assume !false; {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 78: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 79: Hoare triple {270075#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {270075#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 81: Hoare triple {270075#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 82: Hoare triple {270075#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 83: Hoare triple {270075#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {270075#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {270075#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 86: Hoare triple {270075#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 87: Hoare triple {270075#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 88: Hoare triple {270075#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {270075#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 90: Hoare triple {270075#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {270075#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 92: Hoare triple {270075#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 93: Hoare triple {270075#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 94: Hoare triple {270075#true} assume 8528 == #t~mem62;havoc #t~mem62; {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 95: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 96: Hoare triple {270075#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; {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 97: Hoare triple {270075#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); {270075#true} is VALID [2022-04-28 15:28:09,111 INFO L290 TraceCheckUtils]: 98: Hoare triple {270075#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {270075#true} is VALID [2022-04-28 15:28:09,112 INFO L290 TraceCheckUtils]: 99: Hoare triple {270075#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {270075#true} is VALID [2022-04-28 15:28:09,112 INFO L290 TraceCheckUtils]: 100: Hoare triple {270075#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {270075#true} is VALID [2022-04-28 15:28:09,112 INFO L290 TraceCheckUtils]: 101: Hoare triple {270075#true} assume !(~ret~0 <= 0); {270075#true} is VALID [2022-04-28 15:28:09,113 INFO L290 TraceCheckUtils]: 102: Hoare triple {270075#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,113 INFO L290 TraceCheckUtils]: 103: Hoare triple {270080#(= 8544 (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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {270080#(= 8544 (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; {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,114 INFO L290 TraceCheckUtils]: 106: Hoare triple {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,115 INFO L290 TraceCheckUtils]: 107: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,115 INFO L290 TraceCheckUtils]: 108: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,116 INFO L290 TraceCheckUtils]: 109: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,116 INFO L290 TraceCheckUtils]: 110: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,116 INFO L290 TraceCheckUtils]: 111: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,117 INFO L290 TraceCheckUtils]: 112: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,117 INFO L290 TraceCheckUtils]: 113: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,118 INFO L290 TraceCheckUtils]: 115: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,118 INFO L290 TraceCheckUtils]: 116: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,119 INFO L290 TraceCheckUtils]: 117: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,119 INFO L290 TraceCheckUtils]: 118: Hoare triple {270080#(= 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); {270080#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 119: Hoare triple {270080#(= 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); {270081#(= |ssl3_accept_#t~mem59| 8544)} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 120: Hoare triple {270081#(= |ssl3_accept_#t~mem59| 8544)} assume 8497 == #t~mem59;havoc #t~mem59; {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 121: Hoare triple {270076#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 122: Hoare triple {270076#false} assume !(1 == ~blastFlag~0); {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 123: Hoare triple {270076#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 124: Hoare triple {270076#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 125: Hoare triple {270076#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,120 INFO L290 TraceCheckUtils]: 126: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 127: Hoare triple {270076#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 128: Hoare triple {270076#false} ~skip~0 := 0; {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 129: Hoare triple {270076#false} assume !false; {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 130: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 131: Hoare triple {270076#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 132: Hoare triple {270076#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 133: Hoare triple {270076#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 134: Hoare triple {270076#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 135: Hoare triple {270076#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 136: Hoare triple {270076#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 137: Hoare triple {270076#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 138: Hoare triple {270076#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 139: Hoare triple {270076#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,121 INFO L290 TraceCheckUtils]: 140: Hoare triple {270076#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 141: Hoare triple {270076#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 142: Hoare triple {270076#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 143: Hoare triple {270076#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 144: Hoare triple {270076#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 145: Hoare triple {270076#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 146: Hoare triple {270076#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 147: Hoare triple {270076#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 148: Hoare triple {270076#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 149: Hoare triple {270076#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 150: Hoare triple {270076#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 151: Hoare triple {270076#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 152: Hoare triple {270076#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,122 INFO L290 TraceCheckUtils]: 153: Hoare triple {270076#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 154: Hoare triple {270076#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 155: Hoare triple {270076#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 156: Hoare triple {270076#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 157: Hoare triple {270076#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 158: Hoare triple {270076#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 159: Hoare triple {270076#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 160: Hoare triple {270076#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 161: Hoare triple {270076#false} assume 8656 == #t~mem77;havoc #t~mem77; {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 162: Hoare triple {270076#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; {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 163: Hoare triple {270076#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 164: Hoare triple {270076#false} assume !(2 == ~blastFlag~0); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 165: Hoare triple {270076#false} assume !(4 == ~blastFlag~0); {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 166: Hoare triple {270076#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {270076#false} is VALID [2022-04-28 15:28:09,123 INFO L290 TraceCheckUtils]: 167: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 168: Hoare triple {270076#false} assume !(0 == ~tmp___10~0); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 169: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 170: Hoare triple {270076#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 171: Hoare triple {270076#false} ~skip~0 := 0; {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 172: Hoare triple {270076#false} assume !false; {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 173: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 174: Hoare triple {270076#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 175: Hoare triple {270076#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 176: Hoare triple {270076#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 177: Hoare triple {270076#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 178: Hoare triple {270076#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 179: Hoare triple {270076#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 180: Hoare triple {270076#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,124 INFO L290 TraceCheckUtils]: 181: Hoare triple {270076#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 182: Hoare triple {270076#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 183: Hoare triple {270076#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 184: Hoare triple {270076#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 185: Hoare triple {270076#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 186: Hoare triple {270076#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 187: Hoare triple {270076#false} assume 8512 == #t~mem60;havoc #t~mem60; {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 188: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 189: Hoare triple {270076#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; {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 190: Hoare triple {270076#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 191: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 192: Hoare triple {270076#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 193: Hoare triple {270076#false} ~skip~0 := 0; {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 194: Hoare triple {270076#false} assume !false; {270076#false} is VALID [2022-04-28 15:28:09,125 INFO L290 TraceCheckUtils]: 195: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 196: Hoare triple {270076#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 197: Hoare triple {270076#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 198: Hoare triple {270076#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 199: Hoare triple {270076#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 200: Hoare triple {270076#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 201: Hoare triple {270076#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 202: Hoare triple {270076#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 203: Hoare triple {270076#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 204: Hoare triple {270076#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 205: Hoare triple {270076#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 206: Hoare triple {270076#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 207: Hoare triple {270076#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 208: Hoare triple {270076#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,126 INFO L290 TraceCheckUtils]: 209: Hoare triple {270076#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 210: Hoare triple {270076#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 211: Hoare triple {270076#false} assume 8528 == #t~mem62;havoc #t~mem62; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 212: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 213: Hoare triple {270076#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; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 214: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 215: Hoare triple {270076#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 216: Hoare triple {270076#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 217: Hoare triple {270076#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 218: Hoare triple {270076#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 219: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 220: Hoare triple {270076#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 221: Hoare triple {270076#false} ~skip~0 := 0; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 222: Hoare triple {270076#false} assume !false; {270076#false} is VALID [2022-04-28 15:28:09,127 INFO L290 TraceCheckUtils]: 223: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 224: Hoare triple {270076#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 225: Hoare triple {270076#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 226: Hoare triple {270076#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 227: Hoare triple {270076#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 228: Hoare triple {270076#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 229: Hoare triple {270076#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 230: Hoare triple {270076#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 231: Hoare triple {270076#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 232: Hoare triple {270076#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 233: Hoare triple {270076#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 234: Hoare triple {270076#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 235: Hoare triple {270076#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 236: Hoare triple {270076#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,128 INFO L290 TraceCheckUtils]: 237: Hoare triple {270076#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 238: Hoare triple {270076#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 239: Hoare triple {270076#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 240: Hoare triple {270076#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 241: Hoare triple {270076#false} assume 8544 == #t~mem64;havoc #t~mem64; {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 242: Hoare triple {270076#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 243: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 244: Hoare triple {270076#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 245: Hoare triple {270076#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); {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 246: Hoare triple {270076#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; {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 247: Hoare triple {270076#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; {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 248: Hoare triple {270076#false} assume 8 == ~blastFlag~0; {270076#false} is VALID [2022-04-28 15:28:09,129 INFO L290 TraceCheckUtils]: 249: Hoare triple {270076#false} assume !false; {270076#false} is VALID [2022-04-28 15:28:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-04-28 15:28:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:09,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612893310] [2022-04-28 15:28:09,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612893310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:09,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:09,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:09,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154722215] [2022-04-28 15:28:09,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154722215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:09,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:09,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123467082] [2022-04-28 15:28:09,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 250 [2022-04-28 15:28:09,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:09,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:09,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:09,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:09,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:09,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:09,268 INFO L87 Difference]: Start difference. First operand 3331 states and 4844 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:11,288 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:28:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:18,064 INFO L93 Difference]: Finished difference Result 6941 states and 10057 transitions. [2022-04-28 15:28:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:18,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 250 [2022-04-28 15:28:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:28:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:28:18,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-28 15:28:18,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:19,042 INFO L225 Difference]: With dead ends: 6941 [2022-04-28 15:28:19,042 INFO L226 Difference]: Without dead ends: 3638 [2022-04-28 15:28:19,045 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:28:19,046 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 69 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:19,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 595 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 522 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:28:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3638 states. [2022-04-28 15:28:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3638 to 3331. [2022-04-28 15:28:22,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:22,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3638 states. Second operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:22,179 INFO L74 IsIncluded]: Start isIncluded. First operand 3638 states. Second operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:22,182 INFO L87 Difference]: Start difference. First operand 3638 states. Second operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:22,530 INFO L93 Difference]: Finished difference Result 3638 states and 5238 transitions. [2022-04-28 15:28:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5238 transitions. [2022-04-28 15:28:22,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:22,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:22,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 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 3638 states. [2022-04-28 15:28:22,539 INFO L87 Difference]: Start difference. First operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 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 3638 states. [2022-04-28 15:28:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:22,884 INFO L93 Difference]: Finished difference Result 3638 states and 5238 transitions. [2022-04-28 15:28:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5238 transitions. [2022-04-28 15:28:22,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:22,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:22,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:22,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3326 states have (on average 1.4530968129885748) internal successors, (4833), 3326 states have internal predecessors, (4833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4837 transitions. [2022-04-28 15:28:23,382 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4837 transitions. Word has length 250 [2022-04-28 15:28:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:23,382 INFO L495 AbstractCegarLoop]: Abstraction has 3331 states and 4837 transitions. [2022-04-28 15:28:23,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:23,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3331 states and 4837 transitions. [2022-04-28 15:28:28,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4837 edges. 4837 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4837 transitions. [2022-04-28 15:28:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-04-28 15:28:28,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:28,871 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 7, 6, 4, 4, 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, 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:28:28,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 15:28:28,871 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:28,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash -620033130, now seen corresponding path program 1 times [2022-04-28 15:28:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:28,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709291089] [2022-04-28 15:28:46,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -620033130, now seen corresponding path program 2 times [2022-04-28 15:28:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:46,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248204817] [2022-04-28 15:28:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:46,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {297914#(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); {297907#true} is VALID [2022-04-28 15:28:47,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {297907#true} assume true; {297907#true} is VALID [2022-04-28 15:28:47,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {297907#true} {297907#true} #689#return; {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {297907#true} call ULTIMATE.init(); {297914#(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:28:47,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {297914#(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); {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {297907#true} assume true; {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297907#true} {297907#true} #689#return; {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {297907#true} call #t~ret161 := main(); {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {297907#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {297907#true} is VALID [2022-04-28 15:28:47,001 INFO L272 TraceCheckUtils]: 7: Hoare triple {297907#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {297907#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {297907#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {297907#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {297907#true} assume !false; {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {297907#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {297907#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {297907#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {297907#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {297907#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {297907#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {297907#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {297907#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {297907#true} assume 8464 == #t~mem55;havoc #t~mem55; {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {297907#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {297907#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {297907#true} ~skip~0 := 0; {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {297907#true} assume !false; {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {297907#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {297907#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {297907#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 36: Hoare triple {297907#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 37: Hoare triple {297907#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 38: Hoare triple {297907#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 39: Hoare triple {297907#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,004 INFO L290 TraceCheckUtils]: 40: Hoare triple {297907#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {297907#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {297907#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 43: Hoare triple {297907#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {297907#true} assume 8496 == #t~mem58;havoc #t~mem58; {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {297907#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {297907#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 47: Hoare triple {297907#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {297907#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {297907#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {297907#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {297907#true} ~skip~0 := 0; {297907#true} is VALID [2022-04-28 15:28:47,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {297907#true} assume !false; {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {297907#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {297907#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {297907#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {297907#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {297907#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {297907#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {297907#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {297907#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {297907#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {297907#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {297907#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {297907#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {297907#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {297907#true} assume 8512 == #t~mem60;havoc #t~mem60; {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 69: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 70: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 71: Hoare triple {297907#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 72: Hoare triple {297907#true} assume !(~ret~0 <= 0); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {297907#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 75: Hoare triple {297907#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 76: Hoare triple {297907#true} ~skip~0 := 0; {297907#true} is VALID [2022-04-28 15:28:47,007 INFO L290 TraceCheckUtils]: 77: Hoare triple {297907#true} assume !false; {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 78: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {297907#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 80: Hoare triple {297907#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {297907#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 82: Hoare triple {297907#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 83: Hoare triple {297907#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 84: Hoare triple {297907#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 85: Hoare triple {297907#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {297907#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 87: Hoare triple {297907#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 88: Hoare triple {297907#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 89: Hoare triple {297907#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 90: Hoare triple {297907#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,008 INFO L290 TraceCheckUtils]: 91: Hoare triple {297907#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 92: Hoare triple {297907#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 93: Hoare triple {297907#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 94: Hoare triple {297907#true} assume 8528 == #t~mem62;havoc #t~mem62; {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 95: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 96: Hoare triple {297907#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; {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 97: Hoare triple {297907#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); {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 98: Hoare triple {297907#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 99: Hoare triple {297907#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 100: Hoare triple {297907#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {297907#true} is VALID [2022-04-28 15:28:47,009 INFO L290 TraceCheckUtils]: 101: Hoare triple {297907#true} assume !(~ret~0 <= 0); {297907#true} is VALID [2022-04-28 15:28:47,010 INFO L290 TraceCheckUtils]: 102: Hoare triple {297907#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,011 INFO L290 TraceCheckUtils]: 103: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,011 INFO L290 TraceCheckUtils]: 104: Hoare triple {297912#(not (= 8482 (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; {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,012 INFO L290 TraceCheckUtils]: 105: Hoare triple {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,012 INFO L290 TraceCheckUtils]: 106: Hoare triple {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,012 INFO L290 TraceCheckUtils]: 107: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,013 INFO L290 TraceCheckUtils]: 108: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,013 INFO L290 TraceCheckUtils]: 109: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,014 INFO L290 TraceCheckUtils]: 110: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,014 INFO L290 TraceCheckUtils]: 111: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,014 INFO L290 TraceCheckUtils]: 112: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,015 INFO L290 TraceCheckUtils]: 113: Hoare triple {297912#(not (= 8482 (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); {297912#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:47,015 INFO L290 TraceCheckUtils]: 114: Hoare triple {297912#(not (= 8482 (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); {297913#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 115: Hoare triple {297913#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 116: Hoare triple {297908#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 117: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 118: Hoare triple {297908#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 119: Hoare triple {297908#false} ~skip~0 := 0; {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 120: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 121: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 122: Hoare triple {297908#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 123: Hoare triple {297908#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 124: Hoare triple {297908#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 125: Hoare triple {297908#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,016 INFO L290 TraceCheckUtils]: 126: Hoare triple {297908#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 127: Hoare triple {297908#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 128: Hoare triple {297908#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 129: Hoare triple {297908#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 130: Hoare triple {297908#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 131: Hoare triple {297908#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 132: Hoare triple {297908#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 133: Hoare triple {297908#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 134: Hoare triple {297908#false} assume 8497 == #t~mem59;havoc #t~mem59; {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 135: Hoare triple {297908#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 136: Hoare triple {297908#false} assume !(1 == ~blastFlag~0); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 137: Hoare triple {297908#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 138: Hoare triple {297908#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,017 INFO L290 TraceCheckUtils]: 139: Hoare triple {297908#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 140: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 141: Hoare triple {297908#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 142: Hoare triple {297908#false} ~skip~0 := 0; {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 143: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 144: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 145: Hoare triple {297908#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 146: Hoare triple {297908#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 147: Hoare triple {297908#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 148: Hoare triple {297908#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 149: Hoare triple {297908#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 150: Hoare triple {297908#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 151: Hoare triple {297908#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,018 INFO L290 TraceCheckUtils]: 152: Hoare triple {297908#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 153: Hoare triple {297908#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 154: Hoare triple {297908#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 155: Hoare triple {297908#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 156: Hoare triple {297908#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 157: Hoare triple {297908#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 158: Hoare triple {297908#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 159: Hoare triple {297908#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 160: Hoare triple {297908#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 161: Hoare triple {297908#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 162: Hoare triple {297908#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 163: Hoare triple {297908#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 164: Hoare triple {297908#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 165: Hoare triple {297908#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,019 INFO L290 TraceCheckUtils]: 166: Hoare triple {297908#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 167: Hoare triple {297908#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 168: Hoare triple {297908#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 169: Hoare triple {297908#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 170: Hoare triple {297908#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 171: Hoare triple {297908#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 172: Hoare triple {297908#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 173: Hoare triple {297908#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 174: Hoare triple {297908#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 175: Hoare triple {297908#false} assume 8656 == #t~mem77;havoc #t~mem77; {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 176: Hoare triple {297908#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; {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 177: Hoare triple {297908#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 178: Hoare triple {297908#false} assume !(2 == ~blastFlag~0); {297908#false} is VALID [2022-04-28 15:28:47,020 INFO L290 TraceCheckUtils]: 179: Hoare triple {297908#false} assume !(4 == ~blastFlag~0); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 180: Hoare triple {297908#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 181: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 182: Hoare triple {297908#false} assume !(0 == ~tmp___10~0); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 183: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 184: Hoare triple {297908#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 185: Hoare triple {297908#false} ~skip~0 := 0; {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 186: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 187: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 188: Hoare triple {297908#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 189: Hoare triple {297908#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 190: Hoare triple {297908#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 191: Hoare triple {297908#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,021 INFO L290 TraceCheckUtils]: 192: Hoare triple {297908#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 193: Hoare triple {297908#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 194: Hoare triple {297908#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 195: Hoare triple {297908#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 196: Hoare triple {297908#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 197: Hoare triple {297908#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 198: Hoare triple {297908#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 199: Hoare triple {297908#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 200: Hoare triple {297908#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 201: Hoare triple {297908#false} assume 8512 == #t~mem60;havoc #t~mem60; {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 202: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 203: Hoare triple {297908#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; {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 204: Hoare triple {297908#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 205: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,022 INFO L290 TraceCheckUtils]: 206: Hoare triple {297908#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 207: Hoare triple {297908#false} ~skip~0 := 0; {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 208: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 209: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 210: Hoare triple {297908#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 211: Hoare triple {297908#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 212: Hoare triple {297908#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 213: Hoare triple {297908#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 214: Hoare triple {297908#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 215: Hoare triple {297908#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 216: Hoare triple {297908#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 217: Hoare triple {297908#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 218: Hoare triple {297908#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,023 INFO L290 TraceCheckUtils]: 219: Hoare triple {297908#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 220: Hoare triple {297908#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 221: Hoare triple {297908#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 222: Hoare triple {297908#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 223: Hoare triple {297908#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 224: Hoare triple {297908#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 225: Hoare triple {297908#false} assume 8528 == #t~mem62;havoc #t~mem62; {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 226: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 227: Hoare triple {297908#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; {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 228: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 229: Hoare triple {297908#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 230: Hoare triple {297908#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 231: Hoare triple {297908#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {297908#false} is VALID [2022-04-28 15:28:47,024 INFO L290 TraceCheckUtils]: 232: Hoare triple {297908#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 233: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 234: Hoare triple {297908#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 235: Hoare triple {297908#false} ~skip~0 := 0; {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 236: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 237: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 238: Hoare triple {297908#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 239: Hoare triple {297908#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 240: Hoare triple {297908#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 241: Hoare triple {297908#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 242: Hoare triple {297908#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 243: Hoare triple {297908#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 244: Hoare triple {297908#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,025 INFO L290 TraceCheckUtils]: 245: Hoare triple {297908#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 246: Hoare triple {297908#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 247: Hoare triple {297908#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 248: Hoare triple {297908#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 249: Hoare triple {297908#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 250: Hoare triple {297908#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 251: Hoare triple {297908#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 252: Hoare triple {297908#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 253: Hoare triple {297908#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 254: Hoare triple {297908#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 255: Hoare triple {297908#false} assume 8544 == #t~mem64;havoc #t~mem64; {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 256: Hoare triple {297908#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 257: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,026 INFO L290 TraceCheckUtils]: 258: Hoare triple {297908#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {297908#false} is VALID [2022-04-28 15:28:47,027 INFO L290 TraceCheckUtils]: 259: Hoare triple {297908#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); {297908#false} is VALID [2022-04-28 15:28:47,027 INFO L290 TraceCheckUtils]: 260: Hoare triple {297908#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; {297908#false} is VALID [2022-04-28 15:28:47,027 INFO L290 TraceCheckUtils]: 261: Hoare triple {297908#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; {297908#false} is VALID [2022-04-28 15:28:47,027 INFO L290 TraceCheckUtils]: 262: Hoare triple {297908#false} assume 8 == ~blastFlag~0; {297908#false} is VALID [2022-04-28 15:28:47,027 INFO L290 TraceCheckUtils]: 263: Hoare triple {297908#false} assume !false; {297908#false} is VALID [2022-04-28 15:28:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-04-28 15:28:47,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:47,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248204817] [2022-04-28 15:28:47,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248204817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:47,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:47,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:47,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:47,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709291089] [2022-04-28 15:28:47,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709291089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:47,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:47,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485890891] [2022-04-28 15:28:47,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:47,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 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 264 [2022-04-28 15:28:47,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:47,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:47,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:47,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:47,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:47,126 INFO L87 Difference]: Start difference. First operand 3331 states and 4837 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:53,430 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:28:55,434 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:28:57,463 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:29:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:04,233 INFO L93 Difference]: Finished difference Result 7060 states and 10208 transitions. [2022-04-28 15:29:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 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 264 [2022-04-28 15:29:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:29:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-28 15:29:04,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-28 15:29:04,616 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:29:05,308 INFO L225 Difference]: With dead ends: 7060 [2022-04-28 15:29:05,309 INFO L226 Difference]: Without dead ends: 3757 [2022-04-28 15:29:05,313 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:29:05,313 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:05,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 366 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 460 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-28 15:29:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2022-04-28 15:29:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3331. [2022-04-28 15:29:08,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:08,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3757 states. Second operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:08,496 INFO L74 IsIncluded]: Start isIncluded. First operand 3757 states. Second operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:08,498 INFO L87 Difference]: Start difference. First operand 3757 states. Second operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:08,861 INFO L93 Difference]: Finished difference Result 3757 states and 5343 transitions. [2022-04-28 15:29:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5343 transitions. [2022-04-28 15:29:08,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:08,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:08,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 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 3757 states. [2022-04-28 15:29:08,869 INFO L87 Difference]: Start difference. First operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 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 3757 states. [2022-04-28 15:29:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:09,244 INFO L93 Difference]: Finished difference Result 3757 states and 5343 transitions. [2022-04-28 15:29:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 5343 transitions. [2022-04-28 15:29:09,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:09,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:09,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:09,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 3326 states have (on average 1.4350571256764884) internal successors, (4773), 3326 states have internal predecessors, (4773), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4777 transitions. [2022-04-28 15:29:09,743 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4777 transitions. Word has length 264 [2022-04-28 15:29:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:09,743 INFO L495 AbstractCegarLoop]: Abstraction has 3331 states and 4777 transitions. [2022-04-28 15:29:09,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:09,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3331 states and 4777 transitions. [2022-04-28 15:29:15,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4777 edges. 4777 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4777 transitions. [2022-04-28 15:29:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-04-28 15:29:15,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:15,300 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:15,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 15:29:15,300 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:15,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1444547086, now seen corresponding path program 1 times [2022-04-28 15:29:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:15,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [138546860] [2022-04-28 15:29:24,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1444547086, now seen corresponding path program 2 times [2022-04-28 15:29:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:24,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896246988] [2022-04-28 15:29:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:24,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {326222#(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); {326215#true} is VALID [2022-04-28 15:29:24,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {326215#true} assume true; {326215#true} is VALID [2022-04-28 15:29:24,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {326215#true} {326215#true} #689#return; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {326215#true} call ULTIMATE.init(); {326222#(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:29:24,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {326222#(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); {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {326215#true} assume true; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326215#true} {326215#true} #689#return; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {326215#true} call #t~ret161 := main(); {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {326215#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L272 TraceCheckUtils]: 7: Hoare triple {326215#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {326215#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {326215#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {326215#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {326215#true} assume !false; {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {326215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {326215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {326215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {326215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {326215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {326215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {326215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {326215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {326215#true} assume 8464 == #t~mem55;havoc #t~mem55; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {326215#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {326215#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {326215#true} ~skip~0 := 0; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {326215#true} assume !false; {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {326215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {326215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 35: Hoare triple {326215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {326215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {326215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {326215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {326215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {326215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {326215#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {326215#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {326215#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {326215#true} assume 8496 == #t~mem58;havoc #t~mem58; {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {326215#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {326215#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 47: Hoare triple {326215#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {326215#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {326215#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {326215#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {326215#true} ~skip~0 := 0; {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {326215#true} assume !false; {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {326215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {326215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {326215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {326215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {326215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {326215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {326215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {326215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {326215#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {326215#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {326215#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {326215#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {326215#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {326215#true} assume 8512 == #t~mem60;havoc #t~mem60; {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {326215#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {326215#true} assume !(~ret~0 <= 0); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 73: Hoare triple {326215#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 74: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,681 INFO L290 TraceCheckUtils]: 75: Hoare triple {326215#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {326215#true} ~skip~0 := 0; {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {326215#true} assume !false; {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {326215#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {326215#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {326215#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {326215#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {326215#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {326215#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {326215#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {326215#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 87: Hoare triple {326215#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {326215#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {326215#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {326215#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {326215#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {326215#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 93: Hoare triple {326215#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 94: Hoare triple {326215#true} assume 8528 == #t~mem62;havoc #t~mem62; {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 95: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 96: Hoare triple {326215#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; {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 97: Hoare triple {326215#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); {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 98: Hoare triple {326215#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 99: Hoare triple {326215#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 100: Hoare triple {326215#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {326215#true} is VALID [2022-04-28 15:29:24,683 INFO L290 TraceCheckUtils]: 101: Hoare triple {326215#true} assume !(~ret~0 <= 0); {326215#true} is VALID [2022-04-28 15:29:24,685 INFO L290 TraceCheckUtils]: 102: Hoare triple {326215#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,685 INFO L290 TraceCheckUtils]: 103: Hoare triple {326220#(not (= 8464 (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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,685 INFO L290 TraceCheckUtils]: 104: Hoare triple {326220#(not (= 8464 (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; {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,686 INFO L290 TraceCheckUtils]: 105: Hoare triple {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,686 INFO L290 TraceCheckUtils]: 106: Hoare triple {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,687 INFO L290 TraceCheckUtils]: 107: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,687 INFO L290 TraceCheckUtils]: 108: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,687 INFO L290 TraceCheckUtils]: 109: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,689 INFO L290 TraceCheckUtils]: 114: Hoare triple {326220#(not (= 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); {326220#(not (= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:24,690 INFO L290 TraceCheckUtils]: 115: Hoare triple {326220#(not (= 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); {326221#(not (= 8464 |ssl3_accept_#t~mem55|))} is VALID [2022-04-28 15:29:24,690 INFO L290 TraceCheckUtils]: 116: Hoare triple {326221#(not (= 8464 |ssl3_accept_#t~mem55|))} assume 8464 == #t~mem55;havoc #t~mem55; {326216#false} is VALID [2022-04-28 15:29:24,690 INFO L290 TraceCheckUtils]: 117: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,690 INFO L290 TraceCheckUtils]: 118: Hoare triple {326216#false} assume !(0 == ~blastFlag~0); {326216#false} is VALID [2022-04-28 15:29:24,690 INFO L290 TraceCheckUtils]: 119: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 120: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 121: Hoare triple {326216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 122: Hoare triple {326216#false} ~skip~0 := 0; {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 123: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 124: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 125: Hoare triple {326216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 126: Hoare triple {326216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 127: Hoare triple {326216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 128: Hoare triple {326216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 129: Hoare triple {326216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 130: Hoare triple {326216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 131: Hoare triple {326216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 132: Hoare triple {326216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,691 INFO L290 TraceCheckUtils]: 133: Hoare triple {326216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 134: Hoare triple {326216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 135: Hoare triple {326216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 136: Hoare triple {326216#false} assume 8496 == #t~mem58;havoc #t~mem58; {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 137: Hoare triple {326216#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 138: Hoare triple {326216#false} assume !(1 == ~blastFlag~0); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 139: Hoare triple {326216#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 140: Hoare triple {326216#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 141: Hoare triple {326216#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 142: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 143: Hoare triple {326216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 144: Hoare triple {326216#false} ~skip~0 := 0; {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 145: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,692 INFO L290 TraceCheckUtils]: 146: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 147: Hoare triple {326216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 148: Hoare triple {326216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 149: Hoare triple {326216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 150: Hoare triple {326216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 151: Hoare triple {326216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 152: Hoare triple {326216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 153: Hoare triple {326216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 154: Hoare triple {326216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 155: Hoare triple {326216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 156: Hoare triple {326216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 157: Hoare triple {326216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 158: Hoare triple {326216#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 159: Hoare triple {326216#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,693 INFO L290 TraceCheckUtils]: 160: Hoare triple {326216#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 161: Hoare triple {326216#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 162: Hoare triple {326216#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 163: Hoare triple {326216#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 164: Hoare triple {326216#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 165: Hoare triple {326216#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 166: Hoare triple {326216#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 167: Hoare triple {326216#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 168: Hoare triple {326216#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 169: Hoare triple {326216#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 170: Hoare triple {326216#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 171: Hoare triple {326216#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 172: Hoare triple {326216#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 173: Hoare triple {326216#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,694 INFO L290 TraceCheckUtils]: 174: Hoare triple {326216#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 175: Hoare triple {326216#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 176: Hoare triple {326216#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 177: Hoare triple {326216#false} assume 8656 == #t~mem77;havoc #t~mem77; {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 178: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 179: Hoare triple {326216#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 180: Hoare triple {326216#false} assume !(2 == ~blastFlag~0); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 181: Hoare triple {326216#false} assume !(4 == ~blastFlag~0); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 182: Hoare triple {326216#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 183: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 184: Hoare triple {326216#false} assume !(0 == ~tmp___10~0); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 185: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 186: Hoare triple {326216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326216#false} is VALID [2022-04-28 15:29:24,695 INFO L290 TraceCheckUtils]: 187: Hoare triple {326216#false} ~skip~0 := 0; {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 188: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 189: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 190: Hoare triple {326216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 191: Hoare triple {326216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 192: Hoare triple {326216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 193: Hoare triple {326216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 194: Hoare triple {326216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 195: Hoare triple {326216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 196: Hoare triple {326216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 197: Hoare triple {326216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 198: Hoare triple {326216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 199: Hoare triple {326216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 200: Hoare triple {326216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,696 INFO L290 TraceCheckUtils]: 201: Hoare triple {326216#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 202: Hoare triple {326216#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 203: Hoare triple {326216#false} assume 8512 == #t~mem60;havoc #t~mem60; {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 204: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 205: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 206: Hoare triple {326216#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 207: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 208: Hoare triple {326216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 209: Hoare triple {326216#false} ~skip~0 := 0; {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 210: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 211: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 212: Hoare triple {326216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 213: Hoare triple {326216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,697 INFO L290 TraceCheckUtils]: 214: Hoare triple {326216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 215: Hoare triple {326216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 216: Hoare triple {326216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 217: Hoare triple {326216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 218: Hoare triple {326216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 219: Hoare triple {326216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 220: Hoare triple {326216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 221: Hoare triple {326216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 222: Hoare triple {326216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 223: Hoare triple {326216#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 224: Hoare triple {326216#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 225: Hoare triple {326216#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 226: Hoare triple {326216#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 227: Hoare triple {326216#false} assume 8528 == #t~mem62;havoc #t~mem62; {326216#false} is VALID [2022-04-28 15:29:24,698 INFO L290 TraceCheckUtils]: 228: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 229: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 230: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 231: Hoare triple {326216#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 232: Hoare triple {326216#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 233: Hoare triple {326216#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 234: Hoare triple {326216#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 235: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 236: Hoare triple {326216#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 237: Hoare triple {326216#false} ~skip~0 := 0; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 238: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 239: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 240: Hoare triple {326216#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,699 INFO L290 TraceCheckUtils]: 241: Hoare triple {326216#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 242: Hoare triple {326216#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 243: Hoare triple {326216#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 244: Hoare triple {326216#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 245: Hoare triple {326216#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 246: Hoare triple {326216#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 247: Hoare triple {326216#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 248: Hoare triple {326216#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 249: Hoare triple {326216#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 250: Hoare triple {326216#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 251: Hoare triple {326216#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 252: Hoare triple {326216#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 253: Hoare triple {326216#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,700 INFO L290 TraceCheckUtils]: 254: Hoare triple {326216#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 255: Hoare triple {326216#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 256: Hoare triple {326216#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 257: Hoare triple {326216#false} assume 8544 == #t~mem64;havoc #t~mem64; {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 258: Hoare triple {326216#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 259: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 260: Hoare triple {326216#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 261: Hoare triple {326216#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); {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 262: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 263: Hoare triple {326216#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; {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 264: Hoare triple {326216#false} assume 8 == ~blastFlag~0; {326216#false} is VALID [2022-04-28 15:29:24,701 INFO L290 TraceCheckUtils]: 265: Hoare triple {326216#false} assume !false; {326216#false} is VALID [2022-04-28 15:29:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 15:29:24,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:24,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896246988] [2022-04-28 15:29:24,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896246988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:24,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:24,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:24,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:24,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [138546860] [2022-04-28 15:29:24,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [138546860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:24,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:24,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237173614] [2022-04-28 15:29:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 266 [2022-04-28 15:29:24,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:24,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:24,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:24,817 INFO L87 Difference]: Start difference. First operand 3331 states and 4777 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:27,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:30,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:35,269 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:29:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:42,691 INFO L93 Difference]: Finished difference Result 7361 states and 10508 transitions. [2022-04-28 15:29:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 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 266 [2022-04-28 15:29:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:29:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:29:42,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:29:43,066 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:29:43,855 INFO L225 Difference]: With dead ends: 7361 [2022-04-28 15:29:43,855 INFO L226 Difference]: Without dead ends: 4058 [2022-04-28 15:29:43,859 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:29:43,860 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 114 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:43,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 403 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 15:29:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2022-04-28 15:29:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 3464. [2022-04-28 15:29:47,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:47,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4058 states. Second operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:47,149 INFO L74 IsIncluded]: Start isIncluded. First operand 4058 states. Second operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:47,152 INFO L87 Difference]: Start difference. First operand 4058 states. Second operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:47,573 INFO L93 Difference]: Finished difference Result 4058 states and 5695 transitions. [2022-04-28 15:29:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5695 transitions. [2022-04-28 15:29:47,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:47,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:47,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 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 4058 states. [2022-04-28 15:29:47,582 INFO L87 Difference]: Start difference. First operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 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 4058 states. [2022-04-28 15:29:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:48,002 INFO L93 Difference]: Finished difference Result 4058 states and 5695 transitions. [2022-04-28 15:29:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5695 transitions. [2022-04-28 15:29:48,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:48,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:48,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:48,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3464 states, 3459 states have (on average 1.410812373518358) internal successors, (4880), 3459 states have internal predecessors, (4880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4884 transitions. [2022-04-28 15:29:48,544 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4884 transitions. Word has length 266 [2022-04-28 15:29:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:48,544 INFO L495 AbstractCegarLoop]: Abstraction has 3464 states and 4884 transitions. [2022-04-28 15:29:48,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:48,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3464 states and 4884 transitions. [2022-04-28 15:29:54,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4884 edges. 4884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4884 transitions. [2022-04-28 15:29:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-04-28 15:29:54,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:54,409 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 15:29:54,410 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 328792406, now seen corresponding path program 1 times [2022-04-28 15:29:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:54,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255671717] [2022-04-28 15:30:03,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 328792406, now seen corresponding path program 2 times [2022-04-28 15:30:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:03,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615034607] [2022-04-28 15:30:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:03,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:03,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:03,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {356000#(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); {355993#true} is VALID [2022-04-28 15:30:03,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {355993#true} assume true; {355993#true} is VALID [2022-04-28 15:30:03,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {355993#true} {355993#true} #689#return; {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {355993#true} call ULTIMATE.init(); {356000#(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:30:03,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {356000#(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); {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {355993#true} assume true; {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355993#true} {355993#true} #689#return; {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {355993#true} call #t~ret161 := main(); {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {355993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L272 TraceCheckUtils]: 7: Hoare triple {355993#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {355993#true} is VALID [2022-04-28 15:30:03,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {355993#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {355993#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {355993#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {355993#true} assume !false; {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {355993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {355993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {355993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {355993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {355993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {355993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {355993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {355993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {355993#true} assume 8464 == #t~mem55;havoc #t~mem55; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {355993#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {355993#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {355993#true} ~skip~0 := 0; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {355993#true} assume !false; {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {355993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {355993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {355993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {355993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {355993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {355993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {355993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {355993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {355993#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {355993#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {355993#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {355993#true} assume 8496 == #t~mem58;havoc #t~mem58; {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {355993#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {355993#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {355993#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {355993#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 49: Hoare triple {355993#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {355993#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {355993#true} ~skip~0 := 0; {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {355993#true} assume !false; {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 55: Hoare triple {355993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {355993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {355993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {355993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {355993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {355993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {355993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {355993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 63: Hoare triple {355993#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {355993#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {355993#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 66: Hoare triple {355993#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 67: Hoare triple {355993#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {355993#true} assume 8512 == #t~mem60;havoc #t~mem60; {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 69: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {355993#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {355993#true} assume !(~ret~0 <= 0); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {355993#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {355993#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355993#true} is VALID [2022-04-28 15:30:03,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {355993#true} ~skip~0 := 0; {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 77: Hoare triple {355993#true} assume !false; {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 78: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 79: Hoare triple {355993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 80: Hoare triple {355993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 81: Hoare triple {355993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 82: Hoare triple {355993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 83: Hoare triple {355993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 84: Hoare triple {355993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {355993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 86: Hoare triple {355993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 87: Hoare triple {355993#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 88: Hoare triple {355993#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {355993#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 90: Hoare triple {355993#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 91: Hoare triple {355993#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 92: Hoare triple {355993#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {355993#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 94: Hoare triple {355993#true} assume 8528 == #t~mem62;havoc #t~mem62; {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 95: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 96: Hoare triple {355993#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; {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 97: Hoare triple {355993#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); {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 98: Hoare triple {355993#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 99: Hoare triple {355993#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 100: Hoare triple {355993#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {355993#true} is VALID [2022-04-28 15:30:03,967 INFO L290 TraceCheckUtils]: 101: Hoare triple {355993#true} assume !(~ret~0 <= 0); {355993#true} is VALID [2022-04-28 15:30:03,968 INFO L290 TraceCheckUtils]: 102: Hoare triple {355993#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,969 INFO L290 TraceCheckUtils]: 103: Hoare triple {355998#(= 8544 (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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,969 INFO L290 TraceCheckUtils]: 104: Hoare triple {355998#(= 8544 (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; {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,970 INFO L290 TraceCheckUtils]: 105: Hoare triple {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,970 INFO L290 TraceCheckUtils]: 106: Hoare triple {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,970 INFO L290 TraceCheckUtils]: 107: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,971 INFO L290 TraceCheckUtils]: 108: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,971 INFO L290 TraceCheckUtils]: 109: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,972 INFO L290 TraceCheckUtils]: 110: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,972 INFO L290 TraceCheckUtils]: 111: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,972 INFO L290 TraceCheckUtils]: 112: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,973 INFO L290 TraceCheckUtils]: 113: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,973 INFO L290 TraceCheckUtils]: 114: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,974 INFO L290 TraceCheckUtils]: 115: Hoare triple {355998#(= 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); {355998#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:03,974 INFO L290 TraceCheckUtils]: 116: Hoare triple {355998#(= 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); {355999#(= |ssl3_accept_#t~mem56| 8544)} is VALID [2022-04-28 15:30:03,974 INFO L290 TraceCheckUtils]: 117: Hoare triple {355999#(= |ssl3_accept_#t~mem56| 8544)} assume 8465 == #t~mem56;havoc #t~mem56; {355994#false} is VALID [2022-04-28 15:30:03,974 INFO L290 TraceCheckUtils]: 118: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,974 INFO L290 TraceCheckUtils]: 119: Hoare triple {355994#false} assume !(0 == ~blastFlag~0); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 120: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 121: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 122: Hoare triple {355994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 123: Hoare triple {355994#false} ~skip~0 := 0; {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 124: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 125: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 126: Hoare triple {355994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 127: Hoare triple {355994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 128: Hoare triple {355994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 129: Hoare triple {355994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 130: Hoare triple {355994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 131: Hoare triple {355994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,975 INFO L290 TraceCheckUtils]: 132: Hoare triple {355994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 133: Hoare triple {355994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 134: Hoare triple {355994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 135: Hoare triple {355994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 136: Hoare triple {355994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 137: Hoare triple {355994#false} assume 8496 == #t~mem58;havoc #t~mem58; {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 138: Hoare triple {355994#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 139: Hoare triple {355994#false} assume !(1 == ~blastFlag~0); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 140: Hoare triple {355994#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 141: Hoare triple {355994#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 142: Hoare triple {355994#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 143: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 144: Hoare triple {355994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355994#false} is VALID [2022-04-28 15:30:03,976 INFO L290 TraceCheckUtils]: 145: Hoare triple {355994#false} ~skip~0 := 0; {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 146: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 147: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 148: Hoare triple {355994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 149: Hoare triple {355994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 150: Hoare triple {355994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 151: Hoare triple {355994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 152: Hoare triple {355994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 153: Hoare triple {355994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 154: Hoare triple {355994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 155: Hoare triple {355994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 156: Hoare triple {355994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 157: Hoare triple {355994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 158: Hoare triple {355994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,977 INFO L290 TraceCheckUtils]: 159: Hoare triple {355994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 160: Hoare triple {355994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 161: Hoare triple {355994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 162: Hoare triple {355994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 163: Hoare triple {355994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 164: Hoare triple {355994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 165: Hoare triple {355994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 166: Hoare triple {355994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 167: Hoare triple {355994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 168: Hoare triple {355994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 169: Hoare triple {355994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 170: Hoare triple {355994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 171: Hoare triple {355994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,978 INFO L290 TraceCheckUtils]: 172: Hoare triple {355994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 173: Hoare triple {355994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 174: Hoare triple {355994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 175: Hoare triple {355994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 176: Hoare triple {355994#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 177: Hoare triple {355994#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 178: Hoare triple {355994#false} assume 8656 == #t~mem77;havoc #t~mem77; {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 179: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 180: Hoare triple {355994#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 181: Hoare triple {355994#false} assume !(2 == ~blastFlag~0); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 182: Hoare triple {355994#false} assume !(4 == ~blastFlag~0); {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 183: Hoare triple {355994#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {355994#false} is VALID [2022-04-28 15:30:03,979 INFO L290 TraceCheckUtils]: 184: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 185: Hoare triple {355994#false} assume !(0 == ~tmp___10~0); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 186: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 187: Hoare triple {355994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 188: Hoare triple {355994#false} ~skip~0 := 0; {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 189: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 190: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 191: Hoare triple {355994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 192: Hoare triple {355994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 193: Hoare triple {355994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 194: Hoare triple {355994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 195: Hoare triple {355994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 196: Hoare triple {355994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 197: Hoare triple {355994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 198: Hoare triple {355994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,980 INFO L290 TraceCheckUtils]: 199: Hoare triple {355994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 200: Hoare triple {355994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 201: Hoare triple {355994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 202: Hoare triple {355994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 203: Hoare triple {355994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 204: Hoare triple {355994#false} assume 8512 == #t~mem60;havoc #t~mem60; {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 205: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 206: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 207: Hoare triple {355994#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 208: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 209: Hoare triple {355994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 210: Hoare triple {355994#false} ~skip~0 := 0; {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 211: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 212: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,981 INFO L290 TraceCheckUtils]: 213: Hoare triple {355994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 214: Hoare triple {355994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 215: Hoare triple {355994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 216: Hoare triple {355994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 217: Hoare triple {355994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 218: Hoare triple {355994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 219: Hoare triple {355994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 220: Hoare triple {355994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 221: Hoare triple {355994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 222: Hoare triple {355994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 223: Hoare triple {355994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 224: Hoare triple {355994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 225: Hoare triple {355994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,982 INFO L290 TraceCheckUtils]: 226: Hoare triple {355994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 227: Hoare triple {355994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 228: Hoare triple {355994#false} assume 8528 == #t~mem62;havoc #t~mem62; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 229: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 230: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 231: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 232: Hoare triple {355994#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 233: Hoare triple {355994#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 234: Hoare triple {355994#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 235: Hoare triple {355994#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 236: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 237: Hoare triple {355994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 238: Hoare triple {355994#false} ~skip~0 := 0; {355994#false} is VALID [2022-04-28 15:30:03,983 INFO L290 TraceCheckUtils]: 239: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 240: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 241: Hoare triple {355994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 242: Hoare triple {355994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 243: Hoare triple {355994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 244: Hoare triple {355994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 245: Hoare triple {355994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 246: Hoare triple {355994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 247: Hoare triple {355994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 248: Hoare triple {355994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 249: Hoare triple {355994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 250: Hoare triple {355994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 251: Hoare triple {355994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,984 INFO L290 TraceCheckUtils]: 252: Hoare triple {355994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 253: Hoare triple {355994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 254: Hoare triple {355994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 255: Hoare triple {355994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 256: Hoare triple {355994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 257: Hoare triple {355994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 258: Hoare triple {355994#false} assume 8544 == #t~mem64;havoc #t~mem64; {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 259: Hoare triple {355994#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 260: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 261: Hoare triple {355994#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 262: Hoare triple {355994#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); {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 263: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 264: Hoare triple {355994#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; {355994#false} is VALID [2022-04-28 15:30:03,985 INFO L290 TraceCheckUtils]: 265: Hoare triple {355994#false} assume 8 == ~blastFlag~0; {355994#false} is VALID [2022-04-28 15:30:03,986 INFO L290 TraceCheckUtils]: 266: Hoare triple {355994#false} assume !false; {355994#false} is VALID [2022-04-28 15:30:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 15:30:03,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:03,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615034607] [2022-04-28 15:30:03,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615034607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:03,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:03,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:03,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:03,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255671717] [2022-04-28 15:30:03,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255671717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:03,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:03,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642878288] [2022-04-28 15:30:03,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:03,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 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 267 [2022-04-28 15:30:03,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:03,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:04,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:04,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:04,106 INFO L87 Difference]: Start difference. First operand 3464 states and 4884 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:06,133 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:30:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:13,236 INFO L93 Difference]: Finished difference Result 7200 states and 10130 transitions. [2022-04-28 15:30:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:13,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 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 267 [2022-04-28 15:30:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-28 15:30:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 508 transitions. [2022-04-28 15:30:13,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 508 transitions. [2022-04-28 15:30:13,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:14,240 INFO L225 Difference]: With dead ends: 7200 [2022-04-28 15:30:14,241 INFO L226 Difference]: Without dead ends: 3764 [2022-04-28 15:30:14,246 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:30:14,247 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 69 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:14,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 589 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:30:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-04-28 15:30:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3464. [2022-04-28 15:30:17,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:17,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3764 states. Second operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:17,539 INFO L74 IsIncluded]: Start isIncluded. First operand 3764 states. Second operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:17,543 INFO L87 Difference]: Start difference. First operand 3764 states. Second operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:17,910 INFO L93 Difference]: Finished difference Result 3764 states and 5271 transitions. [2022-04-28 15:30:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5271 transitions. [2022-04-28 15:30:17,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:17,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:17,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:30:17,920 INFO L87 Difference]: Start difference. First operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 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 3764 states. [2022-04-28 15:30:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:18,290 INFO L93 Difference]: Finished difference Result 3764 states and 5271 transitions. [2022-04-28 15:30:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5271 transitions. [2022-04-28 15:30:18,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:18,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:18,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:18,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3464 states, 3459 states have (on average 1.4087886672448684) internal successors, (4873), 3459 states have internal predecessors, (4873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4877 transitions. [2022-04-28 15:30:18,832 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 4877 transitions. Word has length 267 [2022-04-28 15:30:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:18,833 INFO L495 AbstractCegarLoop]: Abstraction has 3464 states and 4877 transitions. [2022-04-28 15:30:18,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:18,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3464 states and 4877 transitions. [2022-04-28 15:30:24,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4877 edges. 4877 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:24,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 4877 transitions. [2022-04-28 15:30:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-04-28 15:30:24,686 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:24,687 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 15:30:24,687 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -692693107, now seen corresponding path program 1 times [2022-04-28 15:30:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:24,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1606618293] [2022-04-28 15:30:34,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -692693107, now seen corresponding path program 2 times [2022-04-28 15:30:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987710342] [2022-04-28 15:30:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:34,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:34,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {384868#(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); {384861#true} is VALID [2022-04-28 15:30:34,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {384861#true} assume true; {384861#true} is VALID [2022-04-28 15:30:34,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {384861#true} {384861#true} #689#return; {384861#true} is VALID [2022-04-28 15:30:34,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {384861#true} call ULTIMATE.init(); {384868#(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:30:34,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {384868#(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); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {384861#true} assume true; {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {384861#true} {384861#true} #689#return; {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {384861#true} call #t~ret161 := main(); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {384861#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {384861#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {384861#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {384861#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {384861#true} is VALID [2022-04-28 15:30:34,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {384861#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {384861#true} assume !false; {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {384861#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {384861#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {384861#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {384861#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {384861#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {384861#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {384861#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {384861#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {384861#true} assume 8464 == #t~mem55;havoc #t~mem55; {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {384861#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {384861#true} is VALID [2022-04-28 15:30:34,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {384861#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {384861#true} ~skip~0 := 0; {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {384861#true} assume !false; {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {384861#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {384861#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {384861#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {384861#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {384861#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {384861#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {384861#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {384861#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {384861#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {384861#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {384861#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {384861#true} assume 8496 == #t~mem58;havoc #t~mem58; {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {384861#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {384861#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {384861#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {384861#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {384861#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {384861#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {384861#true} ~skip~0 := 0; {384861#true} is VALID [2022-04-28 15:30:34,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {384861#true} assume !false; {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {384861#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {384861#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {384861#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {384861#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 59: Hoare triple {384861#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 60: Hoare triple {384861#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 61: Hoare triple {384861#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 62: Hoare triple {384861#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {384861#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {384861#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {384861#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {384861#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 67: Hoare triple {384861#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {384861#true} assume 8512 == #t~mem60;havoc #t~mem60; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 70: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 71: Hoare triple {384861#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 72: Hoare triple {384861#true} assume !(~ret~0 <= 0); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {384861#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {384861#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 76: Hoare triple {384861#true} ~skip~0 := 0; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 77: Hoare triple {384861#true} assume !false; {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 78: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,371 INFO L290 TraceCheckUtils]: 79: Hoare triple {384861#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 80: Hoare triple {384861#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 81: Hoare triple {384861#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 82: Hoare triple {384861#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 83: Hoare triple {384861#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 84: Hoare triple {384861#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 85: Hoare triple {384861#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 86: Hoare triple {384861#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 87: Hoare triple {384861#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 88: Hoare triple {384861#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 89: Hoare triple {384861#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 90: Hoare triple {384861#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 91: Hoare triple {384861#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {384861#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {384861#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 94: Hoare triple {384861#true} assume 8528 == #t~mem62;havoc #t~mem62; {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 95: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {384861#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; {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 97: Hoare triple {384861#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); {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 98: Hoare triple {384861#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 99: Hoare triple {384861#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 100: Hoare triple {384861#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {384861#true} is VALID [2022-04-28 15:30:34,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {384861#true} assume !(~ret~0 <= 0); {384861#true} is VALID [2022-04-28 15:30:34,374 INFO L290 TraceCheckUtils]: 102: Hoare triple {384861#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,375 INFO L290 TraceCheckUtils]: 103: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,375 INFO L290 TraceCheckUtils]: 104: Hoare triple {384866#(not (= 8466 (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; {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,376 INFO L290 TraceCheckUtils]: 105: Hoare triple {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,376 INFO L290 TraceCheckUtils]: 106: Hoare triple {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,376 INFO L290 TraceCheckUtils]: 107: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,377 INFO L290 TraceCheckUtils]: 108: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,377 INFO L290 TraceCheckUtils]: 109: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,378 INFO L290 TraceCheckUtils]: 110: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,378 INFO L290 TraceCheckUtils]: 111: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,378 INFO L290 TraceCheckUtils]: 112: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,379 INFO L290 TraceCheckUtils]: 113: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,379 INFO L290 TraceCheckUtils]: 114: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,380 INFO L290 TraceCheckUtils]: 116: Hoare triple {384866#(not (= 8466 (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); {384866#(not (= 8466 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:30:34,380 INFO L290 TraceCheckUtils]: 117: Hoare triple {384866#(not (= 8466 (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); {384867#(not (= 8466 |ssl3_accept_#t~mem57|))} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {384867#(not (= 8466 |ssl3_accept_#t~mem57|))} assume 8466 == #t~mem57;havoc #t~mem57; {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {384862#false} assume !(0 == ~blastFlag~0); {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 122: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 123: Hoare triple {384862#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {384862#false} ~skip~0 := 0; {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 125: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 126: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 127: Hoare triple {384862#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,381 INFO L290 TraceCheckUtils]: 128: Hoare triple {384862#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 129: Hoare triple {384862#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 130: Hoare triple {384862#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 131: Hoare triple {384862#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 132: Hoare triple {384862#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 133: Hoare triple {384862#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 134: Hoare triple {384862#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 135: Hoare triple {384862#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 136: Hoare triple {384862#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 137: Hoare triple {384862#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 138: Hoare triple {384862#false} assume 8496 == #t~mem58;havoc #t~mem58; {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 139: Hoare triple {384862#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 140: Hoare triple {384862#false} assume !(1 == ~blastFlag~0); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 141: Hoare triple {384862#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,382 INFO L290 TraceCheckUtils]: 142: Hoare triple {384862#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 143: Hoare triple {384862#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 144: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 145: Hoare triple {384862#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 146: Hoare triple {384862#false} ~skip~0 := 0; {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 147: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 148: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 149: Hoare triple {384862#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 150: Hoare triple {384862#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 151: Hoare triple {384862#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 152: Hoare triple {384862#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 153: Hoare triple {384862#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 154: Hoare triple {384862#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,383 INFO L290 TraceCheckUtils]: 155: Hoare triple {384862#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 156: Hoare triple {384862#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 157: Hoare triple {384862#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 158: Hoare triple {384862#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 159: Hoare triple {384862#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 160: Hoare triple {384862#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 161: Hoare triple {384862#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 162: Hoare triple {384862#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 163: Hoare triple {384862#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 164: Hoare triple {384862#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 165: Hoare triple {384862#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 166: Hoare triple {384862#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,384 INFO L290 TraceCheckUtils]: 167: Hoare triple {384862#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 168: Hoare triple {384862#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 169: Hoare triple {384862#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 170: Hoare triple {384862#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 171: Hoare triple {384862#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 172: Hoare triple {384862#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 173: Hoare triple {384862#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 174: Hoare triple {384862#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 175: Hoare triple {384862#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 176: Hoare triple {384862#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 177: Hoare triple {384862#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 178: Hoare triple {384862#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 179: Hoare triple {384862#false} assume 8656 == #t~mem77;havoc #t~mem77; {384862#false} is VALID [2022-04-28 15:30:34,385 INFO L290 TraceCheckUtils]: 180: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 181: Hoare triple {384862#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 182: Hoare triple {384862#false} assume !(2 == ~blastFlag~0); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 183: Hoare triple {384862#false} assume !(4 == ~blastFlag~0); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 184: Hoare triple {384862#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 185: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 186: Hoare triple {384862#false} assume !(0 == ~tmp___10~0); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 187: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 188: Hoare triple {384862#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 189: Hoare triple {384862#false} ~skip~0 := 0; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 190: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 191: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 192: Hoare triple {384862#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,386 INFO L290 TraceCheckUtils]: 193: Hoare triple {384862#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 194: Hoare triple {384862#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 195: Hoare triple {384862#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 196: Hoare triple {384862#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 197: Hoare triple {384862#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 198: Hoare triple {384862#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 199: Hoare triple {384862#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 200: Hoare triple {384862#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 201: Hoare triple {384862#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 202: Hoare triple {384862#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 203: Hoare triple {384862#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 204: Hoare triple {384862#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 205: Hoare triple {384862#false} assume 8512 == #t~mem60;havoc #t~mem60; {384862#false} is VALID [2022-04-28 15:30:34,387 INFO L290 TraceCheckUtils]: 206: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 207: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 208: Hoare triple {384862#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 209: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 210: Hoare triple {384862#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 211: Hoare triple {384862#false} ~skip~0 := 0; {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 212: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 213: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 214: Hoare triple {384862#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 215: Hoare triple {384862#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 216: Hoare triple {384862#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 217: Hoare triple {384862#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 218: Hoare triple {384862#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 219: Hoare triple {384862#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,388 INFO L290 TraceCheckUtils]: 220: Hoare triple {384862#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 221: Hoare triple {384862#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 222: Hoare triple {384862#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 223: Hoare triple {384862#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 224: Hoare triple {384862#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 225: Hoare triple {384862#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 226: Hoare triple {384862#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 227: Hoare triple {384862#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 228: Hoare triple {384862#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 229: Hoare triple {384862#false} assume 8528 == #t~mem62;havoc #t~mem62; {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 230: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 231: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 232: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,389 INFO L290 TraceCheckUtils]: 233: Hoare triple {384862#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 234: Hoare triple {384862#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 235: Hoare triple {384862#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 236: Hoare triple {384862#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 237: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 238: Hoare triple {384862#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 239: Hoare triple {384862#false} ~skip~0 := 0; {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 240: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 241: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 242: Hoare triple {384862#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 243: Hoare triple {384862#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 244: Hoare triple {384862#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 245: Hoare triple {384862#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,390 INFO L290 TraceCheckUtils]: 246: Hoare triple {384862#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 247: Hoare triple {384862#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 248: Hoare triple {384862#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 249: Hoare triple {384862#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 250: Hoare triple {384862#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 251: Hoare triple {384862#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 252: Hoare triple {384862#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 253: Hoare triple {384862#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 254: Hoare triple {384862#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 255: Hoare triple {384862#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 256: Hoare triple {384862#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 257: Hoare triple {384862#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,391 INFO L290 TraceCheckUtils]: 258: Hoare triple {384862#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 259: Hoare triple {384862#false} assume 8544 == #t~mem64;havoc #t~mem64; {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 260: Hoare triple {384862#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 261: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 262: Hoare triple {384862#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 263: Hoare triple {384862#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); {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 264: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 265: Hoare triple {384862#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; {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 266: Hoare triple {384862#false} assume 8 == ~blastFlag~0; {384862#false} is VALID [2022-04-28 15:30:34,392 INFO L290 TraceCheckUtils]: 267: Hoare triple {384862#false} assume !false; {384862#false} is VALID [2022-04-28 15:30:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 15:30:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:34,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987710342] [2022-04-28 15:30:34,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987710342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:34,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:34,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:34,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:34,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1606618293] [2022-04-28 15:30:34,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1606618293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:34,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:34,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:34,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787274816] [2022-04-28 15:30:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 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 268 [2022-04-28 15:30:34,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:34,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:34,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:34,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:34,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:34,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:34,510 INFO L87 Difference]: Start difference. First operand 3464 states and 4877 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:36,536 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:30:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:44,152 INFO L93 Difference]: Finished difference Result 7627 states and 10701 transitions. [2022-04-28 15:30:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:44,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 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 268 [2022-04-28 15:30:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:30:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-28 15:30:44,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-28 15:30:44,536 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:30:45,283 INFO L225 Difference]: With dead ends: 7627 [2022-04-28 15:30:45,283 INFO L226 Difference]: Without dead ends: 4191 [2022-04-28 15:30:45,287 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:30:45,287 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 120 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:45,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 366 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 459 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:30:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2022-04-28 15:30:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 3611. [2022-04-28 15:30:48,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:48,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4191 states. Second operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:48,729 INFO L74 IsIncluded]: Start isIncluded. First operand 4191 states. Second operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:48,732 INFO L87 Difference]: Start difference. First operand 4191 states. Second operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:49,182 INFO L93 Difference]: Finished difference Result 4191 states and 5788 transitions. [2022-04-28 15:30:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5788 transitions. [2022-04-28 15:30:49,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:49,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:49,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 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 4191 states. [2022-04-28 15:30:49,194 INFO L87 Difference]: Start difference. First operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 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 4191 states. [2022-04-28 15:30:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:49,649 INFO L93 Difference]: Finished difference Result 4191 states and 5788 transitions. [2022-04-28 15:30:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5788 transitions. [2022-04-28 15:30:49,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:49,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:49,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:49,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 3606 states have (on average 1.3868552412645592) internal successors, (5001), 3606 states have internal predecessors, (5001), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 5005 transitions. [2022-04-28 15:30:50,233 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 5005 transitions. Word has length 268 [2022-04-28 15:30:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:50,233 INFO L495 AbstractCegarLoop]: Abstraction has 3611 states and 5005 transitions. [2022-04-28 15:30:50,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:50,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3611 states and 5005 transitions. [2022-04-28 15:30:56,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5005 edges. 5005 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 5005 transitions. [2022-04-28 15:30:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-04-28 15:30:56,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:56,430 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 7, 4, 4, 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, 1, 1, 1, 1, 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:30:56,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 15:30:56,430 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1247788371, now seen corresponding path program 3 times [2022-04-28 15:30:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:56,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [333449463] [2022-04-28 15:31:14,145 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1247788371, now seen corresponding path program 4 times [2022-04-28 15:31:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:14,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653211649] [2022-04-28 15:31:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:14,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {415740#(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); {415731#true} is VALID [2022-04-28 15:31:14,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {415731#true} assume true; {415731#true} is VALID [2022-04-28 15:31:14,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {415731#true} {415731#true} #689#return; {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {415731#true} call ULTIMATE.init(); {415740#(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:31:14,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {415740#(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); {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {415731#true} assume true; {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415731#true} {415731#true} #689#return; {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {415731#true} call #t~ret161 := main(); {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {415731#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L272 TraceCheckUtils]: 7: Hoare triple {415731#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {415731#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {415731#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {415731#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {415731#true} assume 8464 == #t~mem55;havoc #t~mem55; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {415731#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 37: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 38: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 39: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {415731#true} assume 8496 == #t~mem58;havoc #t~mem58; {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {415731#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {415731#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {415731#true} is VALID [2022-04-28 15:31:14,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {415731#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {415731#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,355 INFO L290 TraceCheckUtils]: 49: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} 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); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,356 INFO L290 TraceCheckUtils]: 51: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,356 INFO L290 TraceCheckUtils]: 52: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} 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); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,358 INFO L290 TraceCheckUtils]: 57: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,359 INFO L290 TraceCheckUtils]: 59: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,359 INFO L290 TraceCheckUtils]: 60: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,361 INFO L290 TraceCheckUtils]: 64: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,361 INFO L290 TraceCheckUtils]: 65: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,361 INFO L290 TraceCheckUtils]: 66: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {415736#(<= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415737#(<= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 68: Hoare triple {415737#(<= |ssl3_accept_#t~mem60| 8512)} assume 8512 == #t~mem60;havoc #t~mem60; {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 69: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 70: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 71: Hoare triple {415731#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {415731#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 76: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 79: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 83: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 84: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 86: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,363 INFO L290 TraceCheckUtils]: 88: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 89: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 90: Hoare triple {415731#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 91: Hoare triple {415731#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 92: Hoare triple {415731#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 93: Hoare triple {415731#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {415731#true} assume 8528 == #t~mem62;havoc #t~mem62; {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 95: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 96: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 97: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 98: Hoare triple {415731#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {415731#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {415731#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {415731#true} is VALID [2022-04-28 15:31:14,364 INFO L290 TraceCheckUtils]: 101: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:14,365 INFO L290 TraceCheckUtils]: 102: Hoare triple {415731#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} 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); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,367 INFO L290 TraceCheckUtils]: 105: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} ~skip~0 := 0; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,367 INFO L290 TraceCheckUtils]: 106: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !false; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,367 INFO L290 TraceCheckUtils]: 107: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} 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); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,368 INFO L290 TraceCheckUtils]: 108: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,368 INFO L290 TraceCheckUtils]: 109: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,368 INFO L290 TraceCheckUtils]: 110: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,369 INFO L290 TraceCheckUtils]: 111: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,369 INFO L290 TraceCheckUtils]: 112: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,370 INFO L290 TraceCheckUtils]: 113: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,370 INFO L290 TraceCheckUtils]: 114: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,370 INFO L290 TraceCheckUtils]: 115: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,371 INFO L290 TraceCheckUtils]: 116: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,371 INFO L290 TraceCheckUtils]: 117: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,372 INFO L290 TraceCheckUtils]: 118: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,372 INFO L290 TraceCheckUtils]: 119: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:14,372 INFO L290 TraceCheckUtils]: 120: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415739#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 121: Hoare triple {415739#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 122: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 123: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 124: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 125: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 126: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 127: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 128: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 129: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 130: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,373 INFO L290 TraceCheckUtils]: 131: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 132: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 133: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 134: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 135: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 136: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 137: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 138: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 139: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 140: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 141: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 142: Hoare triple {415732#false} assume 8497 == #t~mem59;havoc #t~mem59; {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 143: Hoare triple {415732#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 144: Hoare triple {415732#false} assume !(1 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:14,374 INFO L290 TraceCheckUtils]: 145: Hoare triple {415732#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 146: Hoare triple {415732#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 147: Hoare triple {415732#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 148: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 149: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 150: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 151: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 152: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 153: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 154: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 155: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 156: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,375 INFO L290 TraceCheckUtils]: 157: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 158: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 159: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 160: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 161: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 162: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 163: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 164: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 165: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 166: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 167: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 168: Hoare triple {415732#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 169: Hoare triple {415732#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 170: Hoare triple {415732#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,376 INFO L290 TraceCheckUtils]: 171: Hoare triple {415732#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 172: Hoare triple {415732#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 173: Hoare triple {415732#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 174: Hoare triple {415732#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 175: Hoare triple {415732#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 176: Hoare triple {415732#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 177: Hoare triple {415732#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 178: Hoare triple {415732#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 179: Hoare triple {415732#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 180: Hoare triple {415732#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 181: Hoare triple {415732#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 182: Hoare triple {415732#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 183: Hoare triple {415732#false} assume 8656 == #t~mem77;havoc #t~mem77; {415732#false} is VALID [2022-04-28 15:31:14,377 INFO L290 TraceCheckUtils]: 184: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 185: Hoare triple {415732#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 186: Hoare triple {415732#false} assume !(2 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 187: Hoare triple {415732#false} assume !(4 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 188: Hoare triple {415732#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 189: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 190: Hoare triple {415732#false} assume !(0 == ~tmp___10~0); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 191: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 192: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 193: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 194: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 195: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 196: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,378 INFO L290 TraceCheckUtils]: 197: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 198: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 199: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 200: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 201: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 202: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 203: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 204: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 205: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 206: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 207: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 208: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 209: Hoare triple {415732#false} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:14,379 INFO L290 TraceCheckUtils]: 210: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 211: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 212: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 213: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 214: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 215: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 216: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 217: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 218: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 219: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 220: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 221: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 222: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,380 INFO L290 TraceCheckUtils]: 223: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 224: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 225: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 226: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 227: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 228: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 229: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 230: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 231: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 232: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 233: Hoare triple {415732#false} assume 8528 == #t~mem62;havoc #t~mem62; {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 234: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 235: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,381 INFO L290 TraceCheckUtils]: 236: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 237: Hoare triple {415732#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 238: Hoare triple {415732#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 239: Hoare triple {415732#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 240: Hoare triple {415732#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 241: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 242: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 243: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 244: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 245: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 246: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 247: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 248: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,382 INFO L290 TraceCheckUtils]: 249: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 250: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 251: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 252: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 253: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 254: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 255: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 256: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 257: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 258: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 259: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 260: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 261: Hoare triple {415732#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,383 INFO L290 TraceCheckUtils]: 262: Hoare triple {415732#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 263: Hoare triple {415732#false} assume 8544 == #t~mem64;havoc #t~mem64; {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 264: Hoare triple {415732#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 265: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 266: Hoare triple {415732#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 267: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 268: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 269: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 270: Hoare triple {415732#false} assume 8 == ~blastFlag~0; {415732#false} is VALID [2022-04-28 15:31:14,384 INFO L290 TraceCheckUtils]: 271: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 519 proven. 38 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-04-28 15:31:14,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653211649] [2022-04-28 15:31:14,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653211649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:31:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298354214] [2022-04-28 15:31:14,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 15:31:14,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:31:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:31:14,387 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:31:14,387 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:31:15,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 15:31:15,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:31:15,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 15:31:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:15,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 15:31:15,409 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 15:31:15,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 15:31:15,470 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-04-28 15:31:15,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 15:31:15,595 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-28 15:31:15,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-28 15:31:15,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-28 15:31:15,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {415731#true} call ULTIMATE.init(); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {415731#true} #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); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {415731#true} assume true; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415731#true} {415731#true} #689#return; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {415731#true} call #t~ret161 := main(); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {415731#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {415731#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {415731#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {415731#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {415731#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {415731#true} assume 8464 == #t~mem55;havoc #t~mem55; {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {415731#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {415731#true} is VALID [2022-04-28 15:31:15,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {415731#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); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 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); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} ~skip~0 := 0; {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !false; {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 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); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {415825#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ 88 ssl3_accept_~s.offset)) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {415731#true} assume 8496 == #t~mem58;havoc #t~mem58; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {415731#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {415731#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {415731#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {415731#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {415731#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 57: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 60: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,918 INFO L290 TraceCheckUtils]: 61: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 63: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 64: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 65: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 66: Hoare triple {415731#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 67: Hoare triple {415731#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {415731#true} assume 8512 == #t~mem60;havoc #t~mem60; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 71: Hoare triple {415731#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 72: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 73: Hoare triple {415731#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 74: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 75: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 76: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 80: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 81: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 82: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 83: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 86: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 87: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 88: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 90: Hoare triple {415731#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {415731#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {415731#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {415731#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 94: Hoare triple {415731#true} assume 8528 == #t~mem62;havoc #t~mem62; {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 95: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 96: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 97: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:15,920 INFO L290 TraceCheckUtils]: 98: Hoare triple {415731#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415731#true} is VALID [2022-04-28 15:31:15,921 INFO L290 TraceCheckUtils]: 99: Hoare triple {415731#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {415731#true} is VALID [2022-04-28 15:31:15,921 INFO L290 TraceCheckUtils]: 100: Hoare triple {415731#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {415731#true} is VALID [2022-04-28 15:31:15,921 INFO L290 TraceCheckUtils]: 101: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:15,921 INFO L290 TraceCheckUtils]: 102: Hoare triple {415731#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,923 INFO L290 TraceCheckUtils]: 103: Hoare triple {416051#(= 8544 (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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,924 INFO L290 TraceCheckUtils]: 104: Hoare triple {416051#(= 8544 (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; {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,924 INFO L290 TraceCheckUtils]: 105: Hoare triple {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,925 INFO L290 TraceCheckUtils]: 106: Hoare triple {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,925 INFO L290 TraceCheckUtils]: 107: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,925 INFO L290 TraceCheckUtils]: 108: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,926 INFO L290 TraceCheckUtils]: 109: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,926 INFO L290 TraceCheckUtils]: 111: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,927 INFO L290 TraceCheckUtils]: 112: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,928 INFO L290 TraceCheckUtils]: 113: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,928 INFO L290 TraceCheckUtils]: 114: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,928 INFO L290 TraceCheckUtils]: 115: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,929 INFO L290 TraceCheckUtils]: 116: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,929 INFO L290 TraceCheckUtils]: 117: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,929 INFO L290 TraceCheckUtils]: 118: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 119: Hoare triple {416051#(= 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); {416051#(= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 120: Hoare triple {416051#(= 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); {416106#(= |ssl3_accept_#t~mem60| 8544)} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 121: Hoare triple {416106#(= |ssl3_accept_#t~mem60| 8544)} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 122: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 123: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,930 INFO L290 TraceCheckUtils]: 124: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 125: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 126: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 127: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 128: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 129: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 130: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 131: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 132: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 133: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 134: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 135: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 136: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 137: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 138: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,931 INFO L290 TraceCheckUtils]: 139: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,932 INFO L290 TraceCheckUtils]: 140: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,933 INFO L290 TraceCheckUtils]: 142: Hoare triple {415732#false} assume 8497 == #t~mem59;havoc #t~mem59; {415732#false} is VALID [2022-04-28 15:31:15,933 INFO L290 TraceCheckUtils]: 143: Hoare triple {415732#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 144: Hoare triple {415732#false} assume !(1 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 145: Hoare triple {415732#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 146: Hoare triple {415732#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 147: Hoare triple {415732#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 148: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,935 INFO L290 TraceCheckUtils]: 149: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 150: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 151: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 152: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 153: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 154: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 155: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 156: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,936 INFO L290 TraceCheckUtils]: 157: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,947 INFO L290 TraceCheckUtils]: 158: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,947 INFO L290 TraceCheckUtils]: 159: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,947 INFO L290 TraceCheckUtils]: 160: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 161: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 162: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 163: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 164: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 165: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 166: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 167: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 168: Hoare triple {415732#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 169: Hoare triple {415732#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 170: Hoare triple {415732#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 171: Hoare triple {415732#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,948 INFO L290 TraceCheckUtils]: 172: Hoare triple {415732#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 173: Hoare triple {415732#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 174: Hoare triple {415732#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 175: Hoare triple {415732#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 176: Hoare triple {415732#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 177: Hoare triple {415732#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 178: Hoare triple {415732#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 179: Hoare triple {415732#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 180: Hoare triple {415732#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 181: Hoare triple {415732#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 182: Hoare triple {415732#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 183: Hoare triple {415732#false} assume 8656 == #t~mem77;havoc #t~mem77; {415732#false} is VALID [2022-04-28 15:31:15,949 INFO L290 TraceCheckUtils]: 184: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 185: Hoare triple {415732#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 186: Hoare triple {415732#false} assume !(2 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 187: Hoare triple {415732#false} assume !(4 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 188: Hoare triple {415732#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 189: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 190: Hoare triple {415732#false} assume !(0 == ~tmp___10~0); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 191: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 192: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 193: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 194: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 195: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 196: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,950 INFO L290 TraceCheckUtils]: 197: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 198: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 199: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 200: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 201: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 202: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 203: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 204: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 205: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 206: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 207: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 208: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 209: Hoare triple {415732#false} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:15,951 INFO L290 TraceCheckUtils]: 210: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 211: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 212: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 213: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 214: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 215: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 216: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 217: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 218: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 219: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 220: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 221: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,952 INFO L290 TraceCheckUtils]: 222: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 223: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 224: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 225: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 226: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 227: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 228: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 229: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 230: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 231: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 232: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 233: Hoare triple {415732#false} assume 8528 == #t~mem62;havoc #t~mem62; {415732#false} is VALID [2022-04-28 15:31:15,953 INFO L290 TraceCheckUtils]: 234: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 235: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 236: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 237: Hoare triple {415732#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 238: Hoare triple {415732#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 239: Hoare triple {415732#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 240: Hoare triple {415732#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 241: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 242: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 243: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 244: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,954 INFO L290 TraceCheckUtils]: 245: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 246: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 247: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 248: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 249: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 250: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 251: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 252: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 253: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 254: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 255: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,955 INFO L290 TraceCheckUtils]: 256: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 257: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 258: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 259: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 260: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 261: Hoare triple {415732#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 262: Hoare triple {415732#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 263: Hoare triple {415732#false} assume 8544 == #t~mem64;havoc #t~mem64; {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 264: Hoare triple {415732#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 265: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 266: Hoare triple {415732#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {415732#false} is VALID [2022-04-28 15:31:15,956 INFO L290 TraceCheckUtils]: 267: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:15,957 INFO L290 TraceCheckUtils]: 268: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,957 INFO L290 TraceCheckUtils]: 269: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:15,957 INFO L290 TraceCheckUtils]: 270: Hoare triple {415732#false} assume 8 == ~blastFlag~0; {415732#false} is VALID [2022-04-28 15:31:15,957 INFO L290 TraceCheckUtils]: 271: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 505 proven. 48 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-28 15:31:15,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 15:31:16,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 271: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 270: Hoare triple {415732#false} assume 8 == ~blastFlag~0; {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 269: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 268: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 267: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 266: Hoare triple {415732#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 265: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,500 INFO L290 TraceCheckUtils]: 264: Hoare triple {415732#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,501 INFO L290 TraceCheckUtils]: 263: Hoare triple {416584#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {415732#false} is VALID [2022-04-28 15:31:16,501 INFO L290 TraceCheckUtils]: 262: Hoare triple {416588#(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); {416584#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 15:31:16,502 INFO L290 TraceCheckUtils]: 261: Hoare triple {416588#(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); {416588#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:31:16,502 INFO L290 TraceCheckUtils]: 260: Hoare triple {416588#(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); {416588#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 259: Hoare triple {416598#(or (= |ssl3_accept_#t~mem60| 8512) (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); {416588#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 258: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {416598#(or (= |ssl3_accept_#t~mem60| 8512) (not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))))} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 257: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 256: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 255: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 254: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 253: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 252: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,503 INFO L290 TraceCheckUtils]: 251: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 250: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 249: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 248: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 247: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 246: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 245: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 244: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 243: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 242: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 241: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,504 INFO L290 TraceCheckUtils]: 240: Hoare triple {415732#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 239: Hoare triple {415732#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 238: Hoare triple {415732#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 237: Hoare triple {415732#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 236: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 235: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 234: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 233: Hoare triple {415732#false} assume 8528 == #t~mem62;havoc #t~mem62; {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 232: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 231: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 230: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 229: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 228: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,505 INFO L290 TraceCheckUtils]: 227: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 226: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 225: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 224: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 223: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 222: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 221: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 220: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 219: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 218: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 217: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 216: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,506 INFO L290 TraceCheckUtils]: 215: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 214: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 213: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 212: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 211: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 210: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 209: Hoare triple {415732#false} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 208: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 207: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 206: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 205: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 204: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,507 INFO L290 TraceCheckUtils]: 203: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 202: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 201: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 200: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 199: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 198: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 197: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 196: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 195: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 194: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 193: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 192: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 191: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,508 INFO L290 TraceCheckUtils]: 190: Hoare triple {415732#false} assume !(0 == ~tmp___10~0); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 189: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 188: Hoare triple {415732#false} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 187: Hoare triple {415732#false} assume !(4 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 186: Hoare triple {415732#false} assume !(2 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 185: Hoare triple {415732#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 184: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 183: Hoare triple {415732#false} assume 8656 == #t~mem77;havoc #t~mem77; {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 182: Hoare triple {415732#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 181: Hoare triple {415732#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 180: Hoare triple {415732#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 179: Hoare triple {415732#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,509 INFO L290 TraceCheckUtils]: 178: Hoare triple {415732#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 177: Hoare triple {415732#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 176: Hoare triple {415732#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 175: Hoare triple {415732#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 174: Hoare triple {415732#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 173: Hoare triple {415732#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 172: Hoare triple {415732#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 171: Hoare triple {415732#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 170: Hoare triple {415732#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 169: Hoare triple {415732#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 168: Hoare triple {415732#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 167: Hoare triple {415732#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 166: Hoare triple {415732#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,510 INFO L290 TraceCheckUtils]: 165: Hoare triple {415732#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 164: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 163: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 162: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 161: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 160: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 159: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 158: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 157: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 156: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 155: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 154: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,511 INFO L290 TraceCheckUtils]: 153: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 152: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 151: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 150: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 149: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 148: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 147: Hoare triple {415732#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 146: Hoare triple {415732#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 145: Hoare triple {415732#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 144: Hoare triple {415732#false} assume !(1 == ~blastFlag~0); {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 143: Hoare triple {415732#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 142: Hoare triple {415732#false} assume 8497 == #t~mem59;havoc #t~mem59; {415732#false} is VALID [2022-04-28 15:31:16,512 INFO L290 TraceCheckUtils]: 141: Hoare triple {415732#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {415732#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 139: Hoare triple {415732#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {415732#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 137: Hoare triple {415732#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 136: Hoare triple {415732#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 135: Hoare triple {415732#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 134: Hoare triple {415732#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 133: Hoare triple {415732#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 132: Hoare triple {415732#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 131: Hoare triple {415732#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 130: Hoare triple {415732#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 129: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,513 INFO L290 TraceCheckUtils]: 128: Hoare triple {415732#false} assume !false; {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 127: Hoare triple {415732#false} ~skip~0 := 0; {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 126: Hoare triple {415732#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 125: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 124: Hoare triple {415732#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 123: Hoare triple {415732#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; {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 122: Hoare triple {415732#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); {415732#false} is VALID [2022-04-28 15:31:16,514 INFO L290 TraceCheckUtils]: 121: Hoare triple {415739#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {415732#false} is VALID [2022-04-28 15:31:16,515 INFO L290 TraceCheckUtils]: 120: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415739#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-28 15:31:16,515 INFO L290 TraceCheckUtils]: 119: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,516 INFO L290 TraceCheckUtils]: 118: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,516 INFO L290 TraceCheckUtils]: 117: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,517 INFO L290 TraceCheckUtils]: 116: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,517 INFO L290 TraceCheckUtils]: 115: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,517 INFO L290 TraceCheckUtils]: 114: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,518 INFO L290 TraceCheckUtils]: 113: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,518 INFO L290 TraceCheckUtils]: 112: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,519 INFO L290 TraceCheckUtils]: 111: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,519 INFO L290 TraceCheckUtils]: 110: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,519 INFO L290 TraceCheckUtils]: 109: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,520 INFO L290 TraceCheckUtils]: 108: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} 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); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,521 INFO L290 TraceCheckUtils]: 106: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !false; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,521 INFO L290 TraceCheckUtils]: 105: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} ~skip~0 := 0; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,521 INFO L290 TraceCheckUtils]: 104: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} 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); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {415731#true} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415738#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512))} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {415731#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {415731#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {415731#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 95: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,523 INFO L290 TraceCheckUtils]: 94: Hoare triple {415731#true} assume 8528 == #t~mem62;havoc #t~mem62; {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {415731#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {415731#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {415731#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {415731#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 89: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 87: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 86: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 85: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,524 INFO L290 TraceCheckUtils]: 82: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {415731#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {415731#true} assume !(~ret~0 <= 0); {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 71: Hoare triple {415731#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 70: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,525 INFO L290 TraceCheckUtils]: 69: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {415731#true} assume 8512 == #t~mem60;havoc #t~mem60; {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 67: Hoare triple {415731#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 66: Hoare triple {415731#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 59: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,526 INFO L290 TraceCheckUtils]: 57: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 52: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {415731#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {415731#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {415731#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {415731#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {415731#true} is VALID [2022-04-28 15:31:16,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {415731#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {415731#true} assume 8496 == #t~mem58;havoc #t~mem58; {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {415731#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {415731#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {415731#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {415731#true} ~skip~0 := 0; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {415731#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {415731#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {415731#true} assume 8464 == #t~mem55;havoc #t~mem55; {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {415731#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {415731#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {415731#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {415731#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {415731#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {415731#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {415731#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {415731#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {415731#true} assume !false; {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {415731#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {415731#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {415731#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {415731#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); {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L272 TraceCheckUtils]: 7: Hoare triple {415731#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {415731#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {415731#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; {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {415731#true} call #t~ret161 := main(); {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415731#true} {415731#true} #689#return; {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {415731#true} assume true; {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {415731#true} #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); {415731#true} is VALID [2022-04-28 15:31:16,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {415731#true} call ULTIMATE.init(); {415731#true} is VALID [2022-04-28 15:31:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 509 proven. 10 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2022-04-28 15:31:16,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298354214] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 15:31:16,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 15:31:16,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 13 [2022-04-28 15:31:16,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:16,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [333449463] [2022-04-28 15:31:16,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [333449463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:16,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:16,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:31:16,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083015443] [2022-04-28 15:31:16,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 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 272 [2022-04-28 15:31:16,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:16,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:16,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:16,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:31:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:31:16,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-28 15:31:16,672 INFO L87 Difference]: Start difference. First operand 3611 states and 5005 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:19,555 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:31:21,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:23,621 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:31:25,642 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:31:28,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:39,583 INFO L93 Difference]: Finished difference Result 8801 states and 12076 transitions. [2022-04-28 15:31:39,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 15:31:39,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 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 272 [2022-04-28 15:31:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2022-04-28 15:31:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2022-04-28 15:31:39,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 752 transitions. [2022-04-28 15:31:40,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 752 edges. 752 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:41,182 INFO L225 Difference]: With dead ends: 8801 [2022-04-28 15:31:41,182 INFO L226 Difference]: Without dead ends: 5218 [2022-04-28 15:31:41,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-28 15:31:41,186 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 222 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 102 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:41,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 738 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 922 Invalid, 4 Unknown, 0 Unchecked, 10.8s Time] [2022-04-28 15:31:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2022-04-28 15:31:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 3779. [2022-04-28 15:31:45,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:45,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5218 states. Second operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:45,499 INFO L74 IsIncluded]: Start isIncluded. First operand 5218 states. Second operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:45,501 INFO L87 Difference]: Start difference. First operand 5218 states. Second operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:46,172 INFO L93 Difference]: Finished difference Result 5218 states and 7036 transitions. [2022-04-28 15:31:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7036 transitions. [2022-04-28 15:31:46,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:46,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:46,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 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 5218 states. [2022-04-28 15:31:46,183 INFO L87 Difference]: Start difference. First operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 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 5218 states. [2022-04-28 15:31:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:46,866 INFO L93 Difference]: Finished difference Result 5218 states and 7036 transitions. [2022-04-28 15:31:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 7036 transitions. [2022-04-28 15:31:46,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:46,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:46,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:46,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3774 states have (on average 1.370429252782194) internal successors, (5172), 3774 states have internal predecessors, (5172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5176 transitions. [2022-04-28 15:31:47,476 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 5176 transitions. Word has length 272 [2022-04-28 15:31:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:47,477 INFO L495 AbstractCegarLoop]: Abstraction has 3779 states and 5176 transitions. [2022-04-28 15:31:47,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:47,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3779 states and 5176 transitions. [2022-04-28 15:31:54,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5176 edges. 5176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 5176 transitions. [2022-04-28 15:31:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-04-28 15:31:54,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:54,602 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:54,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 15:31:54,803 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,SelfDestructingSolverStorable44 [2022-04-28 15:31:54,803 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1662758773, now seen corresponding path program 1 times [2022-04-28 15:31:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:54,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [242849616]