/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:29:33,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:29:33,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:29:33,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:29:33,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:29:33,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:29:33,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:29:33,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:29:33,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:29:33,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:29:33,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:29:33,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:29:33,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:29:33,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:29:33,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:29:33,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:29:33,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:29:33,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:29:33,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:29:33,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:29:33,609 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:29:33,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:29:33,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:29:33,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:29:33,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:29:33,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:29:33,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:29:33,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:29:33,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:29:33,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:29:33,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:29:33,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:29:33,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:29:33,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:29:33,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:29:33,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:29:33,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:29:33,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:29:33,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:29:33,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:29:33,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:29:33,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:29:33,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:29:33,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:29:33,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:29:33,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:29:33,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:29:33,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:29:33,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:29:33,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:29:33,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:29:33,657 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:29:33,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:29:33,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:29:33,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:29:33,660 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:29:33,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:29:33,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:29:33,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:29:33,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:29:33,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:29:33,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:29:33,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:29:33,663 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:29:33,663 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:29:33,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:29:33,663 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:29:33,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:29:33,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:29:33,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:29:33,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:29:33,933 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:29:33,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-2.c [2022-04-27 15:29:33,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c00f296/e41bcb258dc14fef953bd1c868018207/FLAGdf9b361d2 [2022-04-27 15:29:34,484 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:29:34,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-2.c [2022-04-27 15:29:34,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c00f296/e41bcb258dc14fef953bd1c868018207/FLAGdf9b361d2 [2022-04-27 15:29:34,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c00f296/e41bcb258dc14fef953bd1c868018207 [2022-04-27 15:29:34,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:29:34,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:29:34,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:29:34,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:29:34,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:29:34,775 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:29:34" (1/1) ... [2022-04-27 15:29:34,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b65583f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:34, skipping insertion in model container [2022-04-27 15:29:34,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:29:34" (1/1) ... [2022-04-27 15:29:34,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:29:34,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:29:35,248 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.09.i.cil-2.c[74369,74382] [2022-04-27 15:29:35,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:29:35,274 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:29:35,423 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.09.i.cil-2.c[74369,74382] [2022-04-27 15:29:35,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:29:35,447 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:29:35,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35 WrapperNode [2022-04-27 15:29:35,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:29:35,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:29:35,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:29:35,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:29:35,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:29:35,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:29:35,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:29:35,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:29:35,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (1/1) ... [2022-04-27 15:29:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:29:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:29:35,644 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-27 15:29:35,654 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-27 15:29:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:29:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:29:35,680 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:29:35,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:29:35,682 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:29:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:29:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:29:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:29:35,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:29:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:29:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:29:35,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:29:35,876 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:29:35,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:29:36,724 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:29:37,312 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:29:37,312 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:29:37,323 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:29:37,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:29:37,334 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:29:37,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:29:37 BoogieIcfgContainer [2022-04-27 15:29:37,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:29:37,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:29:37,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:29:37,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:29:37,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:29:34" (1/3) ... [2022-04-27 15:29:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ff847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:29:37, skipping insertion in model container [2022-04-27 15:29:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:29:35" (2/3) ... [2022-04-27 15:29:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126ff847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:29:37, skipping insertion in model container [2022-04-27 15:29:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:29:37" (3/3) ... [2022-04-27 15:29:37,349 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2022-04-27 15:29:37,362 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:29:37,362 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:29:37,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:29:37,420 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@7dc44fec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c499477 [2022-04-27 15:29:37,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:29:37,428 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-27 15:29:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 15:29:37,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:37,436 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-27 15:29:37,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-27 15:29:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:37,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090566078] [2022-04-27 15:29:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:37,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-27 15:29:37,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:29:37,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-27 15:29:37,977 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-27 15:29:37,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-27 15:29:37,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-27 15:29:37,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-27 15:29:37,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-27 15:29:37,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-27 15:29:37,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {161#true} is VALID [2022-04-27 15:29:37,978 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-27 15:29:37,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:37,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:38,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-27 15:29:38,011 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-27 15:29:38,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {162#false} is VALID [2022-04-27 15:29:38,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {162#false} is VALID [2022-04-27 15:29:38,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-27 15:29:38,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {162#false} is VALID [2022-04-27 15:29:38,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-27 15:29:38,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-27 15:29:38,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-27 15:29:38,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-27 15:29:38,016 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-27 15:29:38,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:38,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090566078] [2022-04-27 15:29:38,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090566078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:38,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:38,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446546885] [2022-04-27 15:29:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:38,033 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-27 15:29:38,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:38,038 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-27 15:29:38,092 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-27 15:29:38,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:38,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:38,121 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-27 15:29:40,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:29:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:43,425 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-27 15:29:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:43,425 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-27 15:29:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:43,426 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-27 15:29:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-27 15:29:43,441 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-27 15:29:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-27 15:29:43,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-27 15:29:44,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:44,104 INFO L225 Difference]: With dead ends: 430 [2022-04-27 15:29:44,104 INFO L226 Difference]: Without dead ends: 261 [2022-04-27 15:29:44,107 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-27 15:29:44,109 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:44,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:29:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-27 15:29:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-27 15:29:44,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:44,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 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-27 15:29:44,167 INFO L74 IsIncluded]: Start isIncluded. First operand 261 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-27 15:29:44,168 INFO L87 Difference]: Start difference. First operand 261 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-27 15:29:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:44,180 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-27 15:29:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-27 15:29:44,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:44,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:44,183 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 261 states. [2022-04-27 15:29:44,183 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 261 states. [2022-04-27 15:29:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:44,195 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-27 15:29:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-27 15:29:44,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:44,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:44,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:44,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:44,204 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-27 15:29:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-27 15:29:44,211 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-27 15:29:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:44,212 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-27 15:29:44,212 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-27 15:29:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-27 15:29:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 15:29:44,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:44,214 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-27 15:29:44,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:29:44,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-27 15:29:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:44,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117130280] [2022-04-27 15:29:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:44,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1417#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1410#true} is VALID [2022-04-27 15:29:44,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-27 15:29:44,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1410#true} {1410#true} #689#return; {1410#true} is VALID [2022-04-27 15:29:44,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1417#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:29:44,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1417#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1410#true} is VALID [2022-04-27 15:29:44,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {1410#true} assume true; {1410#true} is VALID [2022-04-27 15:29:44,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1410#true} {1410#true} #689#return; {1410#true} is VALID [2022-04-27 15:29:44,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {1410#true} call #t~ret161 := main(); {1410#true} is VALID [2022-04-27 15:29:44,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {1410#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1410#true} is VALID [2022-04-27 15:29:44,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1410#true} is VALID [2022-04-27 15:29:44,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {1410#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1410#true} is VALID [2022-04-27 15:29:44,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1410#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:44,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {1415#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1416#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-27 15:29:44,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {1416#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1411#false} is VALID [2022-04-27 15:29:44,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {1411#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {1411#false} is VALID [2022-04-27 15:29:44,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {1411#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {1411#false} is VALID [2022-04-27 15:29:44,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {1411#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1411#false} is VALID [2022-04-27 15:29:44,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {1411#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {1411#false} is VALID [2022-04-27 15:29:44,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {1411#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1411#false} is VALID [2022-04-27 15:29:44,460 INFO L290 TraceCheckUtils]: 40: Hoare triple {1411#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1411#false} is VALID [2022-04-27 15:29:44,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {1411#false} assume 8 == ~blastFlag~0; {1411#false} is VALID [2022-04-27 15:29:44,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-27 15:29:44,461 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-27 15:29:44,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:44,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117130280] [2022-04-27 15:29:44,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117130280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:44,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:44,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127811870] [2022-04-27 15:29:44,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:44,463 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-27 15:29:44,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:44,463 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-27 15:29:44,508 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-27 15:29:44,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:44,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:44,511 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-27 15:29:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:50,158 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-27 15:29:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:50,158 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-27 15:29:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:50,159 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-27 15:29:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:29:50,168 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-27 15:29:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:29:50,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-27 15:29:50,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:50,642 INFO L225 Difference]: With dead ends: 444 [2022-04-27 15:29:50,642 INFO L226 Difference]: Without dead ends: 289 [2022-04-27 15:29:50,643 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-27 15:29:50,644 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:50,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:29:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-27 15:29:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-27 15:29:50,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:50,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 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-27 15:29:50,654 INFO L74 IsIncluded]: Start isIncluded. First operand 289 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-27 15:29:50,655 INFO L87 Difference]: Start difference. First operand 289 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-27 15:29:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:50,663 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-27 15:29:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-27 15:29:50,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:50,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:50,665 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 289 states. [2022-04-27 15:29:50,665 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 289 states. [2022-04-27 15:29:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:50,674 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-27 15:29:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-27 15:29:50,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:50,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:50,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:50,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:50,676 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-27 15:29:50,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-27 15:29:50,682 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-27 15:29:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:50,682 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-27 15:29:50,683 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-27 15:29:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-27 15:29:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 15:29:50,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:50,684 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-27 15:29:50,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:29:50,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-27 15:29:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:50,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200190828] [2022-04-27 15:29:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:50,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {2762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2755#true} is VALID [2022-04-27 15:29:50,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-27 15:29:50,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2755#true} {2755#true} #689#return; {2755#true} is VALID [2022-04-27 15:29:50,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:29:50,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {2762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2755#true} is VALID [2022-04-27 15:29:50,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2022-04-27 15:29:50,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #689#return; {2755#true} is VALID [2022-04-27 15:29:50,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret161 := main(); {2755#true} is VALID [2022-04-27 15:29:50,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {2755#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2755#true} is VALID [2022-04-27 15:29:50,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {2755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2755#true} is VALID [2022-04-27 15:29:50,894 INFO L272 TraceCheckUtils]: 7: Hoare triple {2755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2755#true} is VALID [2022-04-27 15:29:50,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {2755#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:50,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {2760#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2761#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-27 15:29:50,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {2761#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {2756#false} is VALID [2022-04-27 15:29:50,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {2756#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2756#false} is VALID [2022-04-27 15:29:50,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {2756#false} assume 4 == ~blastFlag~0; {2756#false} is VALID [2022-04-27 15:29:50,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2022-04-27 15:29:50,934 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-27 15:29:50,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:50,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200190828] [2022-04-27 15:29:50,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200190828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:50,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:50,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61938437] [2022-04-27 15:29:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:50,935 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-27 15:29:50,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:50,936 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-27 15:29:50,981 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-27 15:29:50,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:50,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:50,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:50,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:50,982 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-27 15:29:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:55,048 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-27 15:29:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:29:55,048 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-27 15:29:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:29:55,049 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-27 15:29:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:29:55,055 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-27 15:29:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-27 15:29:55,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-27 15:29:55,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:29:55,537 INFO L225 Difference]: With dead ends: 503 [2022-04-27 15:29:55,538 INFO L226 Difference]: Without dead ends: 319 [2022-04-27 15:29:55,539 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-27 15:29:55,540 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:29:55,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 15:29:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-27 15:29:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-27 15:29:55,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:29:55,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 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-27 15:29:55,550 INFO L74 IsIncluded]: Start isIncluded. First operand 319 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-27 15:29:55,551 INFO L87 Difference]: Start difference. First operand 319 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-27 15:29:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:55,559 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-27 15:29:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-27 15:29:55,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:55,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:55,560 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 319 states. [2022-04-27 15:29:55,561 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 319 states. [2022-04-27 15:29:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:29:55,569 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-27 15:29:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-27 15:29:55,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:29:55,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:29:55,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:29:55,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:29:55,570 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-27 15:29:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-27 15:29:55,575 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-27 15:29:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:29:55,576 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-27 15:29:55,576 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-27 15:29:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-27 15:29:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 15:29:55,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:29:55,577 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-27 15:29:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:29:55,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:29:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:29:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-27 15:29:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:29:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702798988] [2022-04-27 15:29:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:29:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:29:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:55,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:29:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:29:55,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {4272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4265#true} is VALID [2022-04-27 15:29:55,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-27 15:29:55,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4265#true} {4265#true} #689#return; {4265#true} is VALID [2022-04-27 15:29:55,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4265#true} call ULTIMATE.init(); {4272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:29:55,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4265#true} {4265#true} #689#return; {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {4265#true} call #t~ret161 := main(); {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {4265#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {4265#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4265#true} is VALID [2022-04-27 15:29:55,734 INFO L272 TraceCheckUtils]: 7: Hoare triple {4265#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4265#true} is VALID [2022-04-27 15:29:55,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {4265#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,751 INFO L290 TraceCheckUtils]: 39: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:29:55,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {4270#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {4271#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-27 15:29:55,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {4271#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {4266#false} is VALID [2022-04-27 15:29:55,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {4266#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4266#false} is VALID [2022-04-27 15:29:55,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {4266#false} assume 4 == ~blastFlag~0; {4266#false} is VALID [2022-04-27 15:29:55,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {4266#false} assume !false; {4266#false} is VALID [2022-04-27 15:29:55,757 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-27 15:29:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:29:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702798988] [2022-04-27 15:29:55,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702798988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:29:55,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:29:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:29:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316944209] [2022-04-27 15:29:55,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:29:55,759 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-27 15:29:55,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:29:55,759 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-27 15:29:55,803 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-27 15:29:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:29:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:29:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:29:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:29:55,805 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-27 15:30:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:03,709 INFO L93 Difference]: Finished difference Result 553 states and 890 transitions. [2022-04-27 15:30:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:03,709 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-27 15:30:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:03,710 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-27 15:30:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-27 15:30:03,714 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-27 15:30:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-27 15:30:03,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-27 15:30:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:04,151 INFO L225 Difference]: With dead ends: 553 [2022-04-27 15:30:04,152 INFO L226 Difference]: Without dead ends: 329 [2022-04-27 15:30:04,153 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-27 15:30:04,153 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 122 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:04,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 356 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:30:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-27 15:30:04,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2022-04-27 15:30:04,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:04,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,164 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,165 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:04,172 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-27 15:30:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-27 15:30:04,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:04,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:04,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-27 15:30:04,174 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-27 15:30:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:04,182 INFO L93 Difference]: Finished difference Result 329 states and 520 transitions. [2022-04-27 15:30:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2022-04-27 15:30:04,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:04,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:04,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:04,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.653061224489796) internal successors, (405), 245 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2022-04-27 15:30:04,189 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 49 [2022-04-27 15:30:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:04,190 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2022-04-27 15:30:04,190 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-27 15:30:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2022-04-27 15:30:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:30:04,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:04,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:30:04,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1073389890, now seen corresponding path program 1 times [2022-04-27 15:30:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994580730] [2022-04-27 15:30:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {5865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5858#true} is VALID [2022-04-27 15:30:04,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-27 15:30:04,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5858#true} {5858#true} #689#return; {5858#true} is VALID [2022-04-27 15:30:04,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:04,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {5865#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5858#true} is VALID [2022-04-27 15:30:04,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2022-04-27 15:30:04,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #689#return; {5858#true} is VALID [2022-04-27 15:30:04,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret161 := main(); {5858#true} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {5858#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5858#true} is VALID [2022-04-27 15:30:04,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {5858#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5858#true} is VALID [2022-04-27 15:30:04,384 INFO L272 TraceCheckUtils]: 7: Hoare triple {5858#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5858#true} is VALID [2022-04-27 15:30:04,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {5858#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {5863#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5864#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {5864#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {5859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {5859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {5859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {5859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {5859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {5859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {5859#false} assume 8528 == #t~mem62;havoc #t~mem62; {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {5859#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {5859#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {5859#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {5859#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {5859#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {5859#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {5859#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {5859#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {5859#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {5859#false} ~skip~0 := 0; {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {5859#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {5859#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {5859#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {5859#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {5859#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {5859#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {5859#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,408 INFO L290 TraceCheckUtils]: 51: Hoare triple {5859#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 52: Hoare triple {5859#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {5859#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 55: Hoare triple {5859#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {5859#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {5859#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {5859#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {5859#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {5859#false} assume 8544 == #t~mem64;havoc #t~mem64; {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {5859#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {5859#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 64: Hoare triple {5859#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {5859#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {5859#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {5859#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {5859#false} is VALID [2022-04-27 15:30:04,410 INFO L290 TraceCheckUtils]: 68: Hoare triple {5859#false} assume 8 == ~blastFlag~0; {5859#false} is VALID [2022-04-27 15:30:04,411 INFO L290 TraceCheckUtils]: 69: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2022-04-27 15:30:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 15:30:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:04,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994580730] [2022-04-27 15:30:04,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994580730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:04,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:04,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165897780] [2022-04-27 15:30:04,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:04,412 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 70 [2022-04-27 15:30:04,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:04,413 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-27 15:30:04,480 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-27 15:30:04,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:04,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:04,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:04,481 INFO L87 Difference]: Start difference. First operand 250 states and 409 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-27 15:30:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:10,082 INFO L93 Difference]: Finished difference Result 513 states and 840 transitions. [2022-04-27 15:30:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:10,083 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 70 [2022-04-27 15:30:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:10,083 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-27 15:30:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:30:10,086 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-27 15:30:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:30:10,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:30:10,458 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-27 15:30:10,464 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:30:10,464 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:30:10,465 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-27 15:30:10,467 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:10,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:30:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:30:10,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:30:10,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:10,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,483 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,483 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:10,489 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:30:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:30:10,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:10,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:10,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:30:10,491 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:30:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:10,504 INFO L93 Difference]: Finished difference Result 278 states and 449 transitions. [2022-04-27 15:30:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 449 transitions. [2022-04-27 15:30:10,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:10,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:10,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:10,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65625) internal successors, (424), 256 states have internal predecessors, (424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 428 transitions. [2022-04-27 15:30:10,511 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 428 transitions. Word has length 70 [2022-04-27 15:30:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:10,511 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 428 transitions. [2022-04-27 15:30:10,511 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-27 15:30:10,511 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 428 transitions. [2022-04-27 15:30:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-27 15:30:10,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:10,513 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:30:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:30:10,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:10,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1770564040, now seen corresponding path program 1 times [2022-04-27 15:30:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860854624] [2022-04-27 15:30:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:10,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {7313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7306#true} is VALID [2022-04-27 15:30:10,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-27 15:30:10,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7306#true} {7306#true} #689#return; {7306#true} is VALID [2022-04-27 15:30:10,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {7306#true} call ULTIMATE.init(); {7313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:10,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {7313#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7306#true} {7306#true} #689#return; {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {7306#true} call #t~ret161 := main(); {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {7306#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7306#true} is VALID [2022-04-27 15:30:10,694 INFO L272 TraceCheckUtils]: 7: Hoare triple {7306#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7306#true} is VALID [2022-04-27 15:30:10,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {7306#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:10,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {7311#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7312#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {7312#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {7307#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {7307#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {7307#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {7307#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {7307#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {7307#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {7307#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {7307#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {7307#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {7307#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {7307#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {7307#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {7307#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {7307#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {7307#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {7307#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {7307#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {7307#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {7307#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {7307#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {7307#false} assume 8528 == #t~mem62;havoc #t~mem62; {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {7307#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {7307#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {7307#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {7307#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {7307#false} is VALID [2022-04-27 15:30:10,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {7307#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {7307#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {7307#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {7307#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {7307#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {7307#false} ~skip~0 := 0; {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {7307#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {7307#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {7307#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {7307#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {7307#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {7307#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {7307#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {7307#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {7307#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 65: Hoare triple {7307#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,709 INFO L290 TraceCheckUtils]: 66: Hoare triple {7307#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,714 INFO L290 TraceCheckUtils]: 67: Hoare triple {7307#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,714 INFO L290 TraceCheckUtils]: 68: Hoare triple {7307#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,714 INFO L290 TraceCheckUtils]: 69: Hoare triple {7307#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {7307#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {7307#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 72: Hoare triple {7307#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 73: Hoare triple {7307#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 74: Hoare triple {7307#false} assume 8544 == #t~mem64;havoc #t~mem64; {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 75: Hoare triple {7307#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 76: Hoare triple {7307#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 77: Hoare triple {7307#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 78: Hoare triple {7307#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 79: Hoare triple {7307#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {7307#false} is VALID [2022-04-27 15:30:10,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {7307#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {7307#false} is VALID [2022-04-27 15:30:10,716 INFO L290 TraceCheckUtils]: 81: Hoare triple {7307#false} assume 8 == ~blastFlag~0; {7307#false} is VALID [2022-04-27 15:30:10,716 INFO L290 TraceCheckUtils]: 82: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-04-27 15:30:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:10,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860854624] [2022-04-27 15:30:10,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860854624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:10,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:10,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075247019] [2022-04-27 15:30:10,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:10,718 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 83 [2022-04-27 15:30:10,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:10,719 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-27 15:30:10,778 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-27 15:30:10,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:10,781 INFO L87 Difference]: Start difference. First operand 261 states and 428 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-27 15:30:15,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:16,353 INFO L93 Difference]: Finished difference Result 513 states and 839 transitions. [2022-04-27 15:30:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:16,353 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 83 [2022-04-27 15:30:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:16,353 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-27 15:30:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:30:16,357 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-27 15:30:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-27 15:30:16,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-27 15:30:16,745 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-27 15:30:16,751 INFO L225 Difference]: With dead ends: 513 [2022-04-27 15:30:16,751 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:30:16,751 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-27 15:30:16,752 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:16,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 15:30:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:30:16,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 261. [2022-04-27 15:30:16,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:16,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:16,759 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:16,759 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:16,765 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:30:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:30:16,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:16,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:16,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:30:16,767 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 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 278 states. [2022-04-27 15:30:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:16,774 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2022-04-27 15:30:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 448 transitions. [2022-04-27 15:30:16,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:16,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:16,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:16,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.65234375) internal successors, (423), 256 states have internal predecessors, (423), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 427 transitions. [2022-04-27 15:30:16,780 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 427 transitions. Word has length 83 [2022-04-27 15:30:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:16,781 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 427 transitions. [2022-04-27 15:30:16,781 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-27 15:30:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 427 transitions. [2022-04-27 15:30:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:30:16,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:16,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:30:16,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:16,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:16,785 INFO L85 PathProgramCache]: Analyzing trace with hash 22704056, now seen corresponding path program 1 times [2022-04-27 15:30:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:16,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283765084] [2022-04-27 15:30:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:16,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {8761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8754#true} is VALID [2022-04-27 15:30:16,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-27 15:30:16,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8754#true} {8754#true} #689#return; {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {8754#true} call ULTIMATE.init(); {8761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:16,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {8761#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8754#true} {8754#true} #689#return; {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {8754#true} call #t~ret161 := main(); {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {8754#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {8754#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8754#true} is VALID [2022-04-27 15:30:16,944 INFO L272 TraceCheckUtils]: 7: Hoare triple {8754#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8754#true} is VALID [2022-04-27 15:30:16,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {8754#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:16,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {8759#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8760#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:30:16,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {8760#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {8755#false} is VALID [2022-04-27 15:30:16,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {8755#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {8755#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,954 INFO L290 TraceCheckUtils]: 19: Hoare triple {8755#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8755#false} is VALID [2022-04-27 15:30:16,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {8755#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {8755#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {8755#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8755#false} is VALID [2022-04-27 15:30:16,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {8755#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {8755#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {8755#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {8755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {8755#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {8755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {8755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {8755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 33: Hoare triple {8755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {8755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {8755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {8755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {8755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {8755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 39: Hoare triple {8755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {8755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {8755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {8755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {8755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {8755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {8755#false} assume 8528 == #t~mem62;havoc #t~mem62; {8755#false} is VALID [2022-04-27 15:30:16,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {8755#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {8755#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {8755#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {8755#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {8755#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {8755#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {8755#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {8755#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 54: Hoare triple {8755#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {8755#false} ~skip~0 := 0; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 57: Hoare triple {8755#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,960 INFO L290 TraceCheckUtils]: 58: Hoare triple {8755#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,961 INFO L290 TraceCheckUtils]: 59: Hoare triple {8755#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 60: Hoare triple {8755#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {8755#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {8755#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {8755#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 64: Hoare triple {8755#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {8755#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {8755#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {8755#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {8755#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {8755#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 70: Hoare triple {8755#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,962 INFO L290 TraceCheckUtils]: 71: Hoare triple {8755#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 72: Hoare triple {8755#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 73: Hoare triple {8755#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 74: Hoare triple {8755#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 75: Hoare triple {8755#false} assume 8544 == #t~mem64;havoc #t~mem64; {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {8755#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 77: Hoare triple {8755#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 78: Hoare triple {8755#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {8755#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {8755#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {8755#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 82: Hoare triple {8755#false} assume 8 == ~blastFlag~0; {8755#false} is VALID [2022-04-27 15:30:16,963 INFO L290 TraceCheckUtils]: 83: Hoare triple {8755#false} assume !false; {8755#false} is VALID [2022-04-27 15:30:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283765084] [2022-04-27 15:30:16,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283765084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:16,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:16,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373944381] [2022-04-27 15:30:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:16,967 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 84 [2022-04-27 15:30:16,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:16,967 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-27 15:30:17,024 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-27 15:30:17,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:17,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:17,026 INFO L87 Difference]: Start difference. First operand 261 states and 427 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-27 15:30:22,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:23,735 INFO L93 Difference]: Finished difference Result 574 states and 927 transitions. [2022-04-27 15:30:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:23,735 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 84 [2022-04-27 15:30:23,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:23,736 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-27 15:30:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-27 15:30:23,740 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-27 15:30:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-27 15:30:23,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-27 15:30:24,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:24,229 INFO L225 Difference]: With dead ends: 574 [2022-04-27 15:30:24,229 INFO L226 Difference]: Without dead ends: 339 [2022-04-27 15:30:24,229 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-27 15:30:24,230 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 150 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:24,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-27 15:30:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-27 15:30:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-27 15:30:24,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:24,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:24,238 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:24,239 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:24,247 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-27 15:30:24,248 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-27 15:30:24,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:24,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:24,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:30:24,249 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:30:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:24,257 INFO L93 Difference]: Finished difference Result 339 states and 533 transitions. [2022-04-27 15:30:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 533 transitions. [2022-04-27 15:30:24,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:24,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:24,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:24,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.63671875) internal successors, (419), 256 states have internal predecessors, (419), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 423 transitions. [2022-04-27 15:30:24,266 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 423 transitions. Word has length 84 [2022-04-27 15:30:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:24,266 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 423 transitions. [2022-04-27 15:30:24,266 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-27 15:30:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 423 transitions. [2022-04-27 15:30:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:30:24,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:24,267 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-04-27 15:30:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:30:24,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1270495820, now seen corresponding path program 1 times [2022-04-27 15:30:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:24,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188870352] [2022-04-27 15:30:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:24,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:24,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {10407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10400#true} is VALID [2022-04-27 15:30:24,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-27 15:30:24,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10400#true} {10400#true} #689#return; {10400#true} is VALID [2022-04-27 15:30:24,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {10400#true} call ULTIMATE.init(); {10407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:24,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {10407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {10400#true} assume true; {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10400#true} {10400#true} #689#return; {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {10400#true} call #t~ret161 := main(); {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {10400#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {10400#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10400#true} is VALID [2022-04-27 15:30:24,419 INFO L272 TraceCheckUtils]: 7: Hoare triple {10400#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10400#true} is VALID [2022-04-27 15:30:24,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {10400#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:24,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {10405#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10406#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {10406#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {10401#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {10401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {10401#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {10401#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {10401#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {10401#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {10401#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {10401#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {10401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10401#false} is VALID [2022-04-27 15:30:24,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {10401#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {10401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {10401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {10401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {10401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {10401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {10401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {10401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {10401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {10401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {10401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {10401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {10401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {10401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {10401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {10401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {10401#false} assume 8528 == #t~mem62;havoc #t~mem62; {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {10401#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 47: Hoare triple {10401#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {10401#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {10401#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {10401#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {10401#false} is VALID [2022-04-27 15:30:24,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {10401#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {10401#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {10401#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {10401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {10401#false} ~skip~0 := 0; {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {10401#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {10401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {10401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {10401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {10401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {10401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {10401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {10401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {10401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {10401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {10401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {10401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 69: Hoare triple {10401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {10401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {10401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {10401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {10401#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,431 INFO L290 TraceCheckUtils]: 74: Hoare triple {10401#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {10401#false} assume 8544 == #t~mem64;havoc #t~mem64; {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {10401#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {10401#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {10401#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 79: Hoare triple {10401#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 80: Hoare triple {10401#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {10401#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 82: Hoare triple {10401#false} assume 8 == ~blastFlag~0; {10401#false} is VALID [2022-04-27 15:30:24,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {10401#false} assume !false; {10401#false} is VALID [2022-04-27 15:30:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:24,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188870352] [2022-04-27 15:30:24,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188870352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:24,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:24,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468821314] [2022-04-27 15:30:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:24,434 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 84 [2022-04-27 15:30:24,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:24,435 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-27 15:30:24,495 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-27 15:30:24,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:24,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:24,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:24,497 INFO L87 Difference]: Start difference. First operand 261 states and 423 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-27 15:30:29,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:30,937 INFO L93 Difference]: Finished difference Result 574 states and 920 transitions. [2022-04-27 15:30:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:30,937 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 84 [2022-04-27 15:30:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:30,938 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-27 15:30:30,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:30:30,942 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-27 15:30:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-27 15:30:30,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-27 15:30:31,366 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-27 15:30:31,373 INFO L225 Difference]: With dead ends: 574 [2022-04-27 15:30:31,373 INFO L226 Difference]: Without dead ends: 339 [2022-04-27 15:30:31,374 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-27 15:30:31,375 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 148 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:31,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-27 15:30:31,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-27 15:30:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-27 15:30:31,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:31,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:31,381 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:31,382 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:31,389 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-27 15:30:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-27 15:30:31,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:31,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:31,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:30:31,391 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 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 339 states. [2022-04-27 15:30:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:31,398 INFO L93 Difference]: Finished difference Result 339 states and 529 transitions. [2022-04-27 15:30:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 529 transitions. [2022-04-27 15:30:31,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:31,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:31,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:31,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.62109375) internal successors, (415), 256 states have internal predecessors, (415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 419 transitions. [2022-04-27 15:30:31,405 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 419 transitions. Word has length 84 [2022-04-27 15:30:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:31,405 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 419 transitions. [2022-04-27 15:30:31,406 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-27 15:30:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 419 transitions. [2022-04-27 15:30:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:30:31,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:31,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:30:31,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:30:31,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1693483075, now seen corresponding path program 1 times [2022-04-27 15:30:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430756936] [2022-04-27 15:30:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:31,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {12053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12046#true} is VALID [2022-04-27 15:30:31,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-27 15:30:31,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12046#true} {12046#true} #689#return; {12046#true} is VALID [2022-04-27 15:30:31,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {12046#true} call ULTIMATE.init(); {12053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:31,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {12053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {12046#true} assume true; {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12046#true} {12046#true} #689#return; {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {12046#true} call #t~ret161 := main(); {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {12046#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {12046#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12046#true} is VALID [2022-04-27 15:30:31,551 INFO L272 TraceCheckUtils]: 7: Hoare triple {12046#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12046#true} is VALID [2022-04-27 15:30:31,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {12046#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:31,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {12051#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12052#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-27 15:30:31,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {12052#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {12047#false} is VALID [2022-04-27 15:30:31,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {12047#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {12047#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {12047#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {12047#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {12047#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {12047#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {12047#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {12047#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {12047#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {12047#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {12047#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {12047#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {12047#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {12047#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 39: Hoare triple {12047#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {12047#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {12047#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {12047#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {12047#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {12047#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {12047#false} assume 8528 == #t~mem62;havoc #t~mem62; {12047#false} is VALID [2022-04-27 15:30:31,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {12047#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {12047#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {12047#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {12047#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {12047#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {12047#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {12047#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {12047#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {12047#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {12047#false} ~skip~0 := 0; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 56: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:30:31,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {12047#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {12047#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {12047#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {12047#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {12047#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {12047#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 63: Hoare triple {12047#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 64: Hoare triple {12047#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 65: Hoare triple {12047#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 66: Hoare triple {12047#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 67: Hoare triple {12047#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 68: Hoare triple {12047#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {12047#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 70: Hoare triple {12047#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 71: Hoare triple {12047#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 72: Hoare triple {12047#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {12047#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 74: Hoare triple {12047#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 75: Hoare triple {12047#false} assume 8544 == #t~mem64;havoc #t~mem64; {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 76: Hoare triple {12047#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 77: Hoare triple {12047#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 78: Hoare triple {12047#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {12047#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {12047#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {12047#false} is VALID [2022-04-27 15:30:31,564 INFO L290 TraceCheckUtils]: 81: Hoare triple {12047#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {12047#false} is VALID [2022-04-27 15:30:31,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {12047#false} assume 8 == ~blastFlag~0; {12047#false} is VALID [2022-04-27 15:30:31,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {12047#false} assume !false; {12047#false} is VALID [2022-04-27 15:30:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430756936] [2022-04-27 15:30:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430756936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:31,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:31,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731824778] [2022-04-27 15:30:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:31,567 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 84 [2022-04-27 15:30:31,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:31,567 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-27 15:30:31,618 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-27 15:30:31,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:31,619 INFO L87 Difference]: Start difference. First operand 261 states and 419 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-27 15:30:34,293 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-27 15:30:35,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:37,462 INFO L93 Difference]: Finished difference Result 510 states and 821 transitions. [2022-04-27 15:30:37,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:37,462 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 84 [2022-04-27 15:30:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:37,463 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-27 15:30:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:30:37,466 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-27 15:30:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-27 15:30:37,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-27 15:30:37,829 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-27 15:30:37,834 INFO L225 Difference]: With dead ends: 510 [2022-04-27 15:30:37,834 INFO L226 Difference]: Without dead ends: 275 [2022-04-27 15:30:37,835 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-27 15:30:37,836 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:37,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-27 15:30:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-27 15:30:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-04-27 15:30:37,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:37,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:37,843 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:37,843 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:37,848 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:30:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:30:37,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:37,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:37,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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 275 states. [2022-04-27 15:30:37,850 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 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 275 states. [2022-04-27 15:30:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:37,855 INFO L93 Difference]: Finished difference Result 275 states and 436 transitions. [2022-04-27 15:30:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 436 transitions. [2022-04-27 15:30:37,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:37,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:37,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:37,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6171875) internal successors, (414), 256 states have internal predecessors, (414), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 418 transitions. [2022-04-27 15:30:37,861 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 418 transitions. Word has length 84 [2022-04-27 15:30:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:37,861 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 418 transitions. [2022-04-27 15:30:37,862 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-27 15:30:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 418 transitions. [2022-04-27 15:30:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:30:37,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:37,863 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 15:30:37,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:30:37,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1703458820, now seen corresponding path program 1 times [2022-04-27 15:30:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:37,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092921034] [2022-04-27 15:30:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:38,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {13490#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13483#true} is VALID [2022-04-27 15:30:38,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-27 15:30:38,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13483#true} {13483#true} #689#return; {13483#true} is VALID [2022-04-27 15:30:38,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {13483#true} call ULTIMATE.init(); {13490#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:38,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {13490#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {13483#true} assume true; {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13483#true} {13483#true} #689#return; {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {13483#true} call #t~ret161 := main(); {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {13483#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13483#true} is VALID [2022-04-27 15:30:38,004 INFO L272 TraceCheckUtils]: 7: Hoare triple {13483#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13483#true} is VALID [2022-04-27 15:30:38,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {13483#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {13488#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13489#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {13489#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13484#false} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {13484#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {13484#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {13484#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13484#false} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-27 15:30:38,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {13484#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {13484#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {13484#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {13484#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {13484#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {13484#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {13484#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {13484#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {13484#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {13484#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {13484#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {13484#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {13484#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {13484#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {13484#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {13484#false} assume 8528 == #t~mem62;havoc #t~mem62; {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {13484#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {13484#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {13484#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {13484#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {13484#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {13484#false} is VALID [2022-04-27 15:30:38,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {13484#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {13484#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {13484#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {13484#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 55: Hoare triple {13484#false} ~skip~0 := 0; {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {13484#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {13484#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {13484#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 60: Hoare triple {13484#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {13484#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {13484#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {13484#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {13484#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {13484#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {13484#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {13484#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {13484#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {13484#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 70: Hoare triple {13484#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {13484#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {13484#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {13484#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 74: Hoare triple {13484#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 75: Hoare triple {13484#false} assume 8544 == #t~mem64;havoc #t~mem64; {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {13484#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {13484#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {13484#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {13484#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {13484#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {13484#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {13484#false} assume 8 == ~blastFlag~0; {13484#false} is VALID [2022-04-27 15:30:38,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {13484#false} assume !false; {13484#false} is VALID [2022-04-27 15:30:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:38,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:38,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092921034] [2022-04-27 15:30:38,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092921034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:38,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:38,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:38,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502206063] [2022-04-27 15:30:38,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:38,020 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 84 [2022-04-27 15:30:38,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:38,020 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-27 15:30:38,080 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-27 15:30:38,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:38,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:38,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:38,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:38,082 INFO L87 Difference]: Start difference. First operand 261 states and 418 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-27 15:30:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:41,704 INFO L93 Difference]: Finished difference Result 573 states and 911 transitions. [2022-04-27 15:30:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:41,704 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 84 [2022-04-27 15:30:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:41,705 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-27 15:30:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-27 15:30:41,709 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-27 15:30:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-27 15:30:41,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-27 15:30:42,112 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-27 15:30:42,118 INFO L225 Difference]: With dead ends: 573 [2022-04-27 15:30:42,118 INFO L226 Difference]: Without dead ends: 338 [2022-04-27 15:30:42,118 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-27 15:30:42,119 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 141 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:42,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 15:30:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-27 15:30:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-27 15:30:42,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:42,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:42,126 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:42,126 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:42,133 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-27 15:30:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-27 15:30:42,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:42,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:42,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:30:42,134 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 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 338 states. [2022-04-27 15:30:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:42,141 INFO L93 Difference]: Finished difference Result 338 states and 523 transitions. [2022-04-27 15:30:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 523 transitions. [2022-04-27 15:30:42,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:42,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:42,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:42,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.6015625) internal successors, (410), 256 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 414 transitions. [2022-04-27 15:30:42,147 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 414 transitions. Word has length 84 [2022-04-27 15:30:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:42,147 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 414 transitions. [2022-04-27 15:30:42,147 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-27 15:30:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 414 transitions. [2022-04-27 15:30:42,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:30:42,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:42,148 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:30:42,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:42,149 INFO L85 PathProgramCache]: Analyzing trace with hash -336623119, now seen corresponding path program 1 times [2022-04-27 15:30:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:42,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045256332] [2022-04-27 15:30:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:42,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {15132#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15125#true} is VALID [2022-04-27 15:30:42,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-27 15:30:42,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15125#true} {15125#true} #689#return; {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {15125#true} call ULTIMATE.init(); {15132#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:42,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {15132#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {15125#true} assume true; {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15125#true} {15125#true} #689#return; {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {15125#true} call #t~ret161 := main(); {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {15125#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {15125#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15125#true} is VALID [2022-04-27 15:30:42,306 INFO L272 TraceCheckUtils]: 7: Hoare triple {15125#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15125#true} is VALID [2022-04-27 15:30:42,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {15125#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:42,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {15130#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15131#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-27 15:30:42,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {15131#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {15126#false} is VALID [2022-04-27 15:30:42,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {15126#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {15126#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15126#false} is VALID [2022-04-27 15:30:42,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {15126#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {15126#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {15126#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {15126#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {15126#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {15126#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {15126#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {15126#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {15126#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {15126#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {15126#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {15126#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {15126#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {15126#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 37: Hoare triple {15126#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 38: Hoare triple {15126#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {15126#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {15126#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {15126#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 42: Hoare triple {15126#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {15126#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {15126#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {15126#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {15126#false} assume 8528 == #t~mem62;havoc #t~mem62; {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {15126#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {15126#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {15126#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {15126#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {15126#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {15126#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {15126#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,316 INFO L290 TraceCheckUtils]: 54: Hoare triple {15126#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {15126#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {15126#false} ~skip~0 := 0; {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {15126#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {15126#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {15126#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {15126#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 62: Hoare triple {15126#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 63: Hoare triple {15126#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 64: Hoare triple {15126#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,317 INFO L290 TraceCheckUtils]: 65: Hoare triple {15126#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {15126#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {15126#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {15126#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 69: Hoare triple {15126#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {15126#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 71: Hoare triple {15126#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {15126#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {15126#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {15126#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {15126#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,318 INFO L290 TraceCheckUtils]: 76: Hoare triple {15126#false} assume 8544 == #t~mem64;havoc #t~mem64; {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {15126#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {15126#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {15126#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {15126#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {15126#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {15126#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 83: Hoare triple {15126#false} assume 8 == ~blastFlag~0; {15126#false} is VALID [2022-04-27 15:30:42,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {15126#false} assume !false; {15126#false} is VALID [2022-04-27 15:30:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045256332] [2022-04-27 15:30:42,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045256332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:42,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:42,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:42,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815147653] [2022-04-27 15:30:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:42,321 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 85 [2022-04-27 15:30:42,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:42,321 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-27 15:30:42,378 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-27 15:30:42,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:42,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:42,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:42,379 INFO L87 Difference]: Start difference. First operand 261 states and 414 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-27 15:30:46,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:49,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:49,973 INFO L93 Difference]: Finished difference Result 509 states and 812 transitions. [2022-04-27 15:30:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:49,973 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 85 [2022-04-27 15:30:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:49,974 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-27 15:30:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:30:49,976 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-27 15:30:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-27 15:30:49,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-27 15:30:50,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:50,297 INFO L225 Difference]: With dead ends: 509 [2022-04-27 15:30:50,297 INFO L226 Difference]: Without dead ends: 274 [2022-04-27 15:30:50,297 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-27 15:30:50,298 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 22 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:50,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-27 15:30:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-04-27 15:30:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 261. [2022-04-27 15:30:50,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:50,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:50,304 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:50,304 INFO L87 Difference]: Start difference. First operand 274 states. Second operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:50,309 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:30:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:30:50,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:50,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:50,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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 274 states. [2022-04-27 15:30:50,311 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 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 274 states. [2022-04-27 15:30:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:50,316 INFO L93 Difference]: Finished difference Result 274 states and 430 transitions. [2022-04-27 15:30:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 430 transitions. [2022-04-27 15:30:50,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:50,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:50,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:50,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.59765625) internal successors, (409), 256 states have internal predecessors, (409), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 413 transitions. [2022-04-27 15:30:50,322 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 413 transitions. Word has length 85 [2022-04-27 15:30:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:50,323 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 413 transitions. [2022-04-27 15:30:50,323 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-27 15:30:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 413 transitions. [2022-04-27 15:30:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 15:30:50,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:50,324 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:50,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:30:50,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1658086991, now seen corresponding path program 1 times [2022-04-27 15:30:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:50,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882779766] [2022-04-27 15:30:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:50,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16558#true} is VALID [2022-04-27 15:30:50,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-27 15:30:50,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16558#true} {16558#true} #689#return; {16558#true} is VALID [2022-04-27 15:30:50,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {16558#true} call ULTIMATE.init(); {16565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:50,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {16565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {16558#true} assume true; {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16558#true} {16558#true} #689#return; {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {16558#true} call #t~ret161 := main(); {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {16558#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {16558#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16558#true} is VALID [2022-04-27 15:30:50,456 INFO L272 TraceCheckUtils]: 7: Hoare triple {16558#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16558#true} is VALID [2022-04-27 15:30:50,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {16558#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:30:50,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {16563#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16564#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:30:50,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {16564#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {16559#false} is VALID [2022-04-27 15:30:50,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {16559#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {16559#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {16559#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {16559#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {16559#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {16559#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {16559#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {16559#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {16559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-27 15:30:50,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {16559#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {16559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {16559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {16559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {16559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 36: Hoare triple {16559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {16559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 38: Hoare triple {16559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 39: Hoare triple {16559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {16559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {16559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {16559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {16559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {16559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {16559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {16559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {16559#false} assume 8528 == #t~mem62;havoc #t~mem62; {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {16559#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {16559#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {16559#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {16559#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {16559#false} is VALID [2022-04-27 15:30:50,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {16559#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {16559#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {16559#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {16559#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {16559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {16559#false} ~skip~0 := 0; {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {16559#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {16559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {16559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {16559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {16559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {16559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {16559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {16559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {16559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {16559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {16559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {16559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {16559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {16559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {16559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {16559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {16559#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {16559#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {16559#false} assume 8544 == #t~mem64;havoc #t~mem64; {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 78: Hoare triple {16559#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {16559#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {16559#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 81: Hoare triple {16559#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 82: Hoare triple {16559#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {16559#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {16559#false} assume 8 == ~blastFlag~0; {16559#false} is VALID [2022-04-27 15:30:50,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {16559#false} assume !false; {16559#false} is VALID [2022-04-27 15:30:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:50,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:50,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882779766] [2022-04-27 15:30:50,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882779766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:50,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:50,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:50,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257978062] [2022-04-27 15:30:50,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:50,471 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 86 [2022-04-27 15:30:50,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:50,471 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-27 15:30:50,529 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-27 15:30:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:50,531 INFO L87 Difference]: Start difference. First operand 261 states and 413 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-27 15:30:52,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:30:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:55,322 INFO L93 Difference]: Finished difference Result 573 states and 903 transitions. [2022-04-27 15:30:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:30:55,322 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 86 [2022-04-27 15:30:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:30:55,322 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-27 15:30:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:30:55,325 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-27 15:30:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-27 15:30:55,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-27 15:30:55,722 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-27 15:30:55,729 INFO L225 Difference]: With dead ends: 573 [2022-04-27 15:30:55,729 INFO L226 Difference]: Without dead ends: 338 [2022-04-27 15:30:55,730 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-27 15:30:55,730 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 144 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:30:55,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:30:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-27 15:30:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 261. [2022-04-27 15:30:55,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:30:55,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,737 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,737 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:55,744 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-27 15:30:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-27 15:30:55,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:55,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:55,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-27 15:30:55,746 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-27 15:30:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:30:55,752 INFO L93 Difference]: Finished difference Result 338 states and 518 transitions. [2022-04-27 15:30:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 518 transitions. [2022-04-27 15:30:55,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:30:55,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:30:55,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:30:55,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:30:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.58203125) internal successors, (405), 256 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 409 transitions. [2022-04-27 15:30:55,759 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 409 transitions. Word has length 86 [2022-04-27 15:30:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:30:55,759 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 409 transitions. [2022-04-27 15:30:55,759 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-27 15:30:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 409 transitions. [2022-04-27 15:30:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:30:55,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:30:55,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:30:55,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:30:55,760 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:30:55,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:30:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1580788918, now seen corresponding path program 1 times [2022-04-27 15:30:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:30:55,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719999663] [2022-04-27 15:30:55,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:30:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:30:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:55,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:30:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:30:55,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {18207#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18200#true} is VALID [2022-04-27 15:30:55,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-27 15:30:55,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18200#true} {18200#true} #689#return; {18200#true} is VALID [2022-04-27 15:30:55,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {18200#true} call ULTIMATE.init(); {18207#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:30:55,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {18207#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18200#true} is VALID [2022-04-27 15:30:55,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {18200#true} assume true; {18200#true} is VALID [2022-04-27 15:30:55,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18200#true} {18200#true} #689#return; {18200#true} is VALID [2022-04-27 15:30:55,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {18200#true} call #t~ret161 := main(); {18200#true} is VALID [2022-04-27 15:30:55,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {18200#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18200#true} is VALID [2022-04-27 15:30:55,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {18200#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18200#true} is VALID [2022-04-27 15:30:55,889 INFO L272 TraceCheckUtils]: 7: Hoare triple {18200#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18200#true} is VALID [2022-04-27 15:30:55,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {18200#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:30:55,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {18205#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18206#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-27 15:30:55,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {18206#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {18201#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {18201#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {18201#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {18201#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {18201#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {18201#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {18201#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {18201#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {18201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:30:55,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {18201#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {18201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {18201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {18201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {18201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {18201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {18201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {18201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {18201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {18201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {18201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {18201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {18201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {18201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {18201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {18201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {18201#false} assume 8528 == #t~mem62;havoc #t~mem62; {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 49: Hoare triple {18201#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 50: Hoare triple {18201#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {18201#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {18201#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {18201#false} is VALID [2022-04-27 15:30:55,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {18201#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 54: Hoare triple {18201#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 55: Hoare triple {18201#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {18201#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {18201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {18201#false} ~skip~0 := 0; {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {18201#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {18201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {18201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 63: Hoare triple {18201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,900 INFO L290 TraceCheckUtils]: 64: Hoare triple {18201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {18201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {18201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {18201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {18201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 69: Hoare triple {18201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 70: Hoare triple {18201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 71: Hoare triple {18201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 72: Hoare triple {18201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 73: Hoare triple {18201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 74: Hoare triple {18201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,901 INFO L290 TraceCheckUtils]: 75: Hoare triple {18201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {18201#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {18201#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {18201#false} assume 8544 == #t~mem64;havoc #t~mem64; {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {18201#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {18201#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {18201#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {18201#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {18201#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 84: Hoare triple {18201#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 85: Hoare triple {18201#false} assume 8 == ~blastFlag~0; {18201#false} is VALID [2022-04-27 15:30:55,902 INFO L290 TraceCheckUtils]: 86: Hoare triple {18201#false} assume !false; {18201#false} is VALID [2022-04-27 15:30:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:30:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:30:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719999663] [2022-04-27 15:30:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719999663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:30:55,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:30:55,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:30:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183109875] [2022-04-27 15:30:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:30:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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-27 15:30:55,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:30:55,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:55,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:30:55,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:30:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:30:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:30:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:30:55,974 INFO L87 Difference]: Start difference. First operand 261 states and 409 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:30:59,000 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-27 15:31:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:02,256 INFO L93 Difference]: Finished difference Result 499 states and 791 transitions. [2022-04-27 15:31:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 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-27 15:31:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:31:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-27 15:31:02,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-27 15:31:02,535 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-27 15:31:02,538 INFO L225 Difference]: With dead ends: 499 [2022-04-27 15:31:02,538 INFO L226 Difference]: Without dead ends: 264 [2022-04-27 15:31:02,538 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-27 15:31:02,539 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:02,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 15:31:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-27 15:31:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2022-04-27 15:31:02,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:02,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 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-27 15:31:02,546 INFO L74 IsIncluded]: Start isIncluded. First operand 264 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-27 15:31:02,546 INFO L87 Difference]: Start difference. First operand 264 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-27 15:31:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:02,551 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:31:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:31:02,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:02,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:02,552 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 264 states. [2022-04-27 15:31:02,552 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 264 states. [2022-04-27 15:31:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:02,557 INFO L93 Difference]: Finished difference Result 264 states and 412 transitions. [2022-04-27 15:31:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 412 transitions. [2022-04-27 15:31:02,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:02,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:02,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:02,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:02,558 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-27 15:31:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-27 15:31:02,563 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 87 [2022-04-27 15:31:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:02,563 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-27 15:31:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-27 15:31:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:31:02,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:02,564 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-27 15:31:02,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:31:02,565 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:02,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:02,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 1 times [2022-04-27 15:31:02,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:02,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449595257] [2022-04-27 15:31:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:02,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {19609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19602#true} is VALID [2022-04-27 15:31:02,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-27 15:31:02,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19602#true} {19602#true} #689#return; {19602#true} is VALID [2022-04-27 15:31:02,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {19602#true} call ULTIMATE.init(); {19609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:02,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {19609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19602#true} is VALID [2022-04-27 15:31:02,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {19602#true} assume true; {19602#true} is VALID [2022-04-27 15:31:02,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19602#true} {19602#true} #689#return; {19602#true} is VALID [2022-04-27 15:31:02,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {19602#true} call #t~ret161 := main(); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {19602#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {19602#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L272 TraceCheckUtils]: 7: Hoare triple {19602#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {19602#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {19602#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {19602#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {19602#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {19602#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {19602#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {19602#true} assume !false; {19602#true} is VALID [2022-04-27 15:31:02,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {19602#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {19602#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {19602#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {19602#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {19602#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {19602#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {19602#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {19602#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {19602#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {19602#true} assume 8464 == #t~mem55;havoc #t~mem55; {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {19602#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {19602#true} is VALID [2022-04-27 15:31:02,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {19602#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {19602#true} is VALID [2022-04-27 15:31:02,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {19602#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:02,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {19607#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19608#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-27 15:31:02,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {19608#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {19603#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {19603#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {19603#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {19603#false} assume 8528 == #t~mem62;havoc #t~mem62; {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {19603#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {19603#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {19603#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {19603#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {19603#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {19603#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {19603#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {19603#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {19603#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {19603#false} ~skip~0 := 0; {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 59: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {19603#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {19603#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {19603#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {19603#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {19603#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {19603#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {19603#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {19603#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {19603#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 69: Hoare triple {19603#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 70: Hoare triple {19603#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {19603#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {19603#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {19603#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {19603#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {19603#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {19603#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {19603#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {19603#false} assume 8544 == #t~mem64;havoc #t~mem64; {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {19603#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {19603#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {19603#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {19603#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {19603#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {19603#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {19603#false} assume 8 == ~blastFlag~0; {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {19603#false} assume !false; {19603#false} is VALID [2022-04-27 15:31:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 15:31:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:02,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449595257] [2022-04-27 15:31:02,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449595257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:02,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:02,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452251768] [2022-04-27 15:31:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:02,704 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 87 [2022-04-27 15:31:02,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:02,704 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-27 15:31:02,780 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-27 15:31:02,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:02,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:02,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:02,782 INFO L87 Difference]: Start difference. First operand 261 states and 408 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-27 15:31:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:08,014 INFO L93 Difference]: Finished difference Result 537 states and 846 transitions. [2022-04-27 15:31:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:08,014 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 87 [2022-04-27 15:31:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:08,014 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-27 15:31:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:31:08,016 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-27 15:31:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-27 15:31:08,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-27 15:31:08,313 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-27 15:31:08,317 INFO L225 Difference]: With dead ends: 537 [2022-04-27 15:31:08,318 INFO L226 Difference]: Without dead ends: 302 [2022-04-27 15:31:08,318 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-27 15:31:08,319 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:08,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:31:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-27 15:31:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 283. [2022-04-27 15:31:08,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:08,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:08,325 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:08,326 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:08,331 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:31:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:31:08,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:08,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:08,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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 302 states. [2022-04-27 15:31:08,333 INFO L87 Difference]: Start difference. First operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 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 302 states. [2022-04-27 15:31:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:08,338 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2022-04-27 15:31:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 467 transitions. [2022-04-27 15:31:08,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:08,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:08,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:08,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 278 states have internal predecessors, (438), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 442 transitions. [2022-04-27 15:31:08,345 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 442 transitions. Word has length 87 [2022-04-27 15:31:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:08,345 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 442 transitions. [2022-04-27 15:31:08,345 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-27 15:31:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 442 transitions. [2022-04-27 15:31:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-27 15:31:08,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:08,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:31:08,347 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 880442311, now seen corresponding path program 1 times [2022-04-27 15:31:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11322906] [2022-04-27 15:31:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:08,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:08,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {21154#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21147#true} is VALID [2022-04-27 15:31:08,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-27 15:31:08,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21147#true} {21147#true} #689#return; {21147#true} is VALID [2022-04-27 15:31:08,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {21147#true} call ULTIMATE.init(); {21154#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:08,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {21154#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21147#true} is VALID [2022-04-27 15:31:08,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {21147#true} assume true; {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21147#true} {21147#true} #689#return; {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {21147#true} call #t~ret161 := main(); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {21147#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {21147#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L272 TraceCheckUtils]: 7: Hoare triple {21147#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {21147#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {21147#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {21147#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {21147#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {21147#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {21147#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {21147#true} assume !false; {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {21147#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {21147#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {21147#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {21147#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {21147#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {21147#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {21147#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {21147#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {21147#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {21147#true} assume 8464 == #t~mem55;havoc #t~mem55; {21147#true} is VALID [2022-04-27 15:31:08,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {21147#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {21147#true} is VALID [2022-04-27 15:31:08,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {21147#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21147#true} is VALID [2022-04-27 15:31:08,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {21147#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {21152#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21153#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {21153#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 40: Hoare triple {21148#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 41: Hoare triple {21148#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 42: Hoare triple {21148#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:31:08,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {21148#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {21148#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {21148#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {21148#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {21148#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {21148#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {21148#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {21148#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {21148#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {21148#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {21148#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {21148#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {21148#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {21148#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {21148#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {21148#false} assume 8528 == #t~mem62;havoc #t~mem62; {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {21148#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {21148#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {21148#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {21148#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {21148#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {21148#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {21148#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {21148#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {21148#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 71: Hoare triple {21148#false} ~skip~0 := 0; {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {21148#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {21148#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {21148#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 76: Hoare triple {21148#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 77: Hoare triple {21148#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 78: Hoare triple {21148#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 79: Hoare triple {21148#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 80: Hoare triple {21148#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {21148#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 82: Hoare triple {21148#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {21148#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {21148#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {21148#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {21148#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 87: Hoare triple {21148#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {21148#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 89: Hoare triple {21148#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {21148#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {21148#false} assume 8544 == #t~mem64;havoc #t~mem64; {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {21148#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {21148#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 94: Hoare triple {21148#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 95: Hoare triple {21148#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {21148#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {21148#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {21148#false} assume 8 == ~blastFlag~0; {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L290 TraceCheckUtils]: 99: Hoare triple {21148#false} assume !false; {21148#false} is VALID [2022-04-27 15:31:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:31:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:08,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11322906] [2022-04-27 15:31:08,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11322906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:08,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:08,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051046762] [2022-04-27 15:31:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:08,504 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 100 [2022-04-27 15:31:08,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:08,505 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-27 15:31:08,569 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-27 15:31:08,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:08,570 INFO L87 Difference]: Start difference. First operand 283 states and 442 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-27 15:31:12,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:15,727 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-27 15:31:16,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:16,823 INFO L93 Difference]: Finished difference Result 657 states and 1030 transitions. [2022-04-27 15:31:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:16,824 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 100 [2022-04-27 15:31:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:16,824 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-27 15:31:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:31:16,828 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-27 15:31:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:31:16,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-27 15:31:17,228 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-27 15:31:17,236 INFO L225 Difference]: With dead ends: 657 [2022-04-27 15:31:17,236 INFO L226 Difference]: Without dead ends: 400 [2022-04-27 15:31:17,237 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-27 15:31:17,238 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 142 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:17,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 360 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-27 15:31:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-27 15:31:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 299. [2022-04-27 15:31:17,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:17,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:17,251 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:17,251 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:17,260 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-27 15:31:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-27 15:31:17,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:17,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:17,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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 400 states. [2022-04-27 15:31:17,262 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 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 400 states. [2022-04-27 15:31:17,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:17,271 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-04-27 15:31:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2022-04-27 15:31:17,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:17,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:17,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:17,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5578231292517006) internal successors, (458), 294 states have internal predecessors, (458), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2022-04-27 15:31:17,278 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 100 [2022-04-27 15:31:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:17,278 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2022-04-27 15:31:17,279 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-27 15:31:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2022-04-27 15:31:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 15:31:17,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:17,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:31:17,281 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -130486748, now seen corresponding path program 1 times [2022-04-27 15:31:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:17,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245982163] [2022-04-27 15:31:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:17,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {23052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23045#true} is VALID [2022-04-27 15:31:17,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-27 15:31:17,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23045#true} {23045#true} #689#return; {23045#true} is VALID [2022-04-27 15:31:17,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {23045#true} call ULTIMATE.init(); {23052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:17,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {23052#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23045#true} is VALID [2022-04-27 15:31:17,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {23045#true} assume true; {23045#true} is VALID [2022-04-27 15:31:17,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23045#true} {23045#true} #689#return; {23045#true} is VALID [2022-04-27 15:31:17,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {23045#true} call #t~ret161 := main(); {23045#true} is VALID [2022-04-27 15:31:17,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {23045#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {23045#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L272 TraceCheckUtils]: 7: Hoare triple {23045#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {23045#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {23045#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {23045#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {23045#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {23045#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {23045#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {23045#true} assume !false; {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {23045#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {23045#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {23045#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {23045#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {23045#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {23045#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {23045#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {23045#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {23045#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {23045#true} assume 8464 == #t~mem55;havoc #t~mem55; {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {23045#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {23045#true} is VALID [2022-04-27 15:31:17,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {23045#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23045#true} is VALID [2022-04-27 15:31:17,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {23045#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {23050#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23051#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {23051#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {23046#false} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {23046#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {23046#false} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {23046#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {23046#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {23046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {23046#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {23046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {23046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {23046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {23046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {23046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {23046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {23046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {23046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {23046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {23046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {23046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {23046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 59: Hoare triple {23046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 60: Hoare triple {23046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 61: Hoare triple {23046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 62: Hoare triple {23046#false} assume 8528 == #t~mem62;havoc #t~mem62; {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 63: Hoare triple {23046#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {23046#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {23046#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {23046#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {23046#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {23046#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {23046#false} is VALID [2022-04-27 15:31:17,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {23046#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {23046#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {23046#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {23046#false} ~skip~0 := 0; {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 74: Hoare triple {23046#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {23046#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {23046#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 77: Hoare triple {23046#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 78: Hoare triple {23046#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {23046#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {23046#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 81: Hoare triple {23046#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 82: Hoare triple {23046#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 83: Hoare triple {23046#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {23046#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 85: Hoare triple {23046#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 86: Hoare triple {23046#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 87: Hoare triple {23046#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 88: Hoare triple {23046#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 89: Hoare triple {23046#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 90: Hoare triple {23046#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 91: Hoare triple {23046#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 92: Hoare triple {23046#false} assume 8544 == #t~mem64;havoc #t~mem64; {23046#false} is VALID [2022-04-27 15:31:17,432 INFO L290 TraceCheckUtils]: 93: Hoare triple {23046#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 94: Hoare triple {23046#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 95: Hoare triple {23046#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 96: Hoare triple {23046#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 97: Hoare triple {23046#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 98: Hoare triple {23046#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 99: Hoare triple {23046#false} assume 8 == ~blastFlag~0; {23046#false} is VALID [2022-04-27 15:31:17,433 INFO L290 TraceCheckUtils]: 100: Hoare triple {23046#false} assume !false; {23046#false} is VALID [2022-04-27 15:31:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:31:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245982163] [2022-04-27 15:31:17,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245982163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:17,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143105359] [2022-04-27 15:31:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-27 15:31:17,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:17,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:17,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:17,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:17,498 INFO L87 Difference]: Start difference. First operand 299 states and 462 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:23,279 INFO L93 Difference]: Finished difference Result 649 states and 1003 transitions. [2022-04-27 15:31:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:23,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 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-27 15:31:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:31:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-27 15:31:23,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-27 15:31:23,672 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-27 15:31:23,678 INFO L225 Difference]: With dead ends: 649 [2022-04-27 15:31:23,678 INFO L226 Difference]: Without dead ends: 376 [2022-04-27 15:31:23,679 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-27 15:31:23,679 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 141 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:23,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 360 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:31:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-27 15:31:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 299. [2022-04-27 15:31:23,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:23,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,686 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,686 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:23,694 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:31:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:31:23,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:23,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:23,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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 376 states. [2022-04-27 15:31:23,695 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 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 376 states. [2022-04-27 15:31:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:23,703 INFO L93 Difference]: Finished difference Result 376 states and 567 transitions. [2022-04-27 15:31:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 567 transitions. [2022-04-27 15:31:23,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:23,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:23,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:23,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5442176870748299) internal successors, (454), 294 states have internal predecessors, (454), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 458 transitions. [2022-04-27 15:31:23,710 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 458 transitions. Word has length 101 [2022-04-27 15:31:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:23,710 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 458 transitions. [2022-04-27 15:31:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 458 transitions. [2022-04-27 15:31:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-27 15:31:23,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:23,712 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:23,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:31:23,712 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1045112784, now seen corresponding path program 1 times [2022-04-27 15:31:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:23,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981778300] [2022-04-27 15:31:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:23,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:23,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {24896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24889#true} is VALID [2022-04-27 15:31:23,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-27 15:31:23,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24889#true} {24889#true} #689#return; {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {24889#true} call ULTIMATE.init(); {24896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:23,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {24896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {24889#true} assume true; {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24889#true} {24889#true} #689#return; {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {24889#true} call #t~ret161 := main(); {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {24889#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {24889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {24889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {24889#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {24889#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {24889#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {24889#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {24889#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {24889#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {24889#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {24889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,846 INFO L290 TraceCheckUtils]: 17: Hoare triple {24889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {24889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {24889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {24889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {24889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {24889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {24889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {24889#true} assume 8464 == #t~mem55;havoc #t~mem55; {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {24889#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {24889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {24889#true} is VALID [2022-04-27 15:31:23,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {24889#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {24889#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {24889#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {24889#true} ~skip~0 := 0; {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {24889#true} assume !false; {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {24889#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {24889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {24889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {24889#true} assume 8192 == #t~mem49;havoc #t~mem49; {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {24889#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {24889#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24889#true} is VALID [2022-04-27 15:31:23,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {24889#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {24889#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, 60 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {24889#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24889#true} is VALID [2022-04-27 15:31:23,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {24889#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {24889#true} is VALID [2022-04-27 15:31:23,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {24889#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:23,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {24894#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24895#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {24895#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {24890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {24890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {24890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {24890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {24890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {24890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {24890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {24890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {24890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {24890#false} assume 8528 == #t~mem62;havoc #t~mem62; {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {24890#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {24890#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {24890#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {24890#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {24890#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {24890#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {24890#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {24890#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 72: Hoare triple {24890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {24890#false} ~skip~0 := 0; {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {24890#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {24890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {24890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {24890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {24890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {24890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {24890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 82: Hoare triple {24890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 83: Hoare triple {24890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 84: Hoare triple {24890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {24890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {24890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {24890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {24890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {24890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {24890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {24890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {24890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {24890#false} assume 8544 == #t~mem64;havoc #t~mem64; {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 94: Hoare triple {24890#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 95: Hoare triple {24890#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {24890#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 97: Hoare triple {24890#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {24890#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 99: Hoare triple {24890#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 100: Hoare triple {24890#false} assume 8 == ~blastFlag~0; {24890#false} is VALID [2022-04-27 15:31:23,859 INFO L290 TraceCheckUtils]: 101: Hoare triple {24890#false} assume !false; {24890#false} is VALID [2022-04-27 15:31:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 15:31:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:23,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981778300] [2022-04-27 15:31:23,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981778300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:23,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:23,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462757833] [2022-04-27 15:31:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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-27 15:31:23,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:23,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:23,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:23,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:23,940 INFO L87 Difference]: Start difference. First operand 299 states and 458 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:25,439 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-27 15:31:28,966 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-27 15:31:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:30,106 INFO L93 Difference]: Finished difference Result 584 states and 901 transitions. [2022-04-27 15:31:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:30,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 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-27 15:31:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:31:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 450 transitions. [2022-04-27 15:31:30,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 450 transitions. [2022-04-27 15:31:30,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:30,407 INFO L225 Difference]: With dead ends: 584 [2022-04-27 15:31:30,407 INFO L226 Difference]: Without dead ends: 311 [2022-04-27 15:31:30,408 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-27 15:31:30,408 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 19 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:30,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 568 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-27 15:31:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-27 15:31:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2022-04-27 15:31:30,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:30,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,415 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,415 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:30,421 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:31:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:31:30,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:30,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:30,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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 311 states. [2022-04-27 15:31:30,422 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 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 311 states. [2022-04-27 15:31:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:30,428 INFO L93 Difference]: Finished difference Result 311 states and 472 transitions. [2022-04-27 15:31:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 472 transitions. [2022-04-27 15:31:30,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:30,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:30,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:30,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5408163265306123) internal successors, (453), 294 states have internal predecessors, (453), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 457 transitions. [2022-04-27 15:31:30,435 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 457 transitions. Word has length 102 [2022-04-27 15:31:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:30,435 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 457 transitions. [2022-04-27 15:31:30,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 457 transitions. [2022-04-27 15:31:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 15:31:30,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:30,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:31:30,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:31:30,437 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1460823327, now seen corresponding path program 1 times [2022-04-27 15:31:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:30,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727226381] [2022-04-27 15:31:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:30,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {26528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26521#true} is VALID [2022-04-27 15:31:30,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-27 15:31:30,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26521#true} {26521#true} #689#return; {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {26521#true} call ULTIMATE.init(); {26528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:30,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {26528#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {26521#true} assume true; {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26521#true} {26521#true} #689#return; {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {26521#true} call #t~ret161 := main(); {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {26521#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {26521#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L272 TraceCheckUtils]: 7: Hoare triple {26521#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {26521#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {26521#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {26521#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {26521#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {26521#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {26521#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {26521#true} assume !false; {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {26521#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {26521#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {26521#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {26521#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {26521#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {26521#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {26521#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {26521#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {26521#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26521#true} is VALID [2022-04-27 15:31:30,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {26521#true} assume 8464 == #t~mem55;havoc #t~mem55; {26521#true} is VALID [2022-04-27 15:31:30,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {26521#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {26521#true} is VALID [2022-04-27 15:31:30,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {26521#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26521#true} is VALID [2022-04-27 15:31:30,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {26521#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {26526#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26527#(= |ssl3_accept_#t~mem49| 8496)} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {26527#(= |ssl3_accept_#t~mem49| 8496)} assume 8192 == #t~mem49;havoc #t~mem49; {26522#false} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {26522#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {26522#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26522#false} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {26522#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,565 INFO L290 TraceCheckUtils]: 39: Hoare triple {26522#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {26522#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 41: Hoare triple {26522#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 42: Hoare triple {26522#false} assume 12292 != #t~mem85;havoc #t~mem85; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {26522#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {26522#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {26522#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 47: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {26522#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 49: Hoare triple {26522#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,566 INFO L290 TraceCheckUtils]: 50: Hoare triple {26522#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 51: Hoare triple {26522#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {26522#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {26522#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {26522#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {26522#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {26522#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {26522#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {26522#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {26522#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,567 INFO L290 TraceCheckUtils]: 60: Hoare triple {26522#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 61: Hoare triple {26522#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 62: Hoare triple {26522#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 63: Hoare triple {26522#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 64: Hoare triple {26522#false} assume 8528 == #t~mem62;havoc #t~mem62; {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {26522#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {26522#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {26522#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {26522#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {26522#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {26522#false} is VALID [2022-04-27 15:31:30,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {26522#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {26522#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {26522#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {26522#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 74: Hoare triple {26522#false} ~skip~0 := 0; {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 75: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 76: Hoare triple {26522#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 77: Hoare triple {26522#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 78: Hoare triple {26522#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 79: Hoare triple {26522#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {26522#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 81: Hoare triple {26522#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 82: Hoare triple {26522#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {26522#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {26522#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {26522#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 86: Hoare triple {26522#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 87: Hoare triple {26522#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 88: Hoare triple {26522#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {26522#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 90: Hoare triple {26522#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,570 INFO L290 TraceCheckUtils]: 91: Hoare triple {26522#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {26522#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {26522#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 94: Hoare triple {26522#false} assume 8544 == #t~mem64;havoc #t~mem64; {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 95: Hoare triple {26522#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 96: Hoare triple {26522#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 97: Hoare triple {26522#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 98: Hoare triple {26522#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 99: Hoare triple {26522#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 100: Hoare triple {26522#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {26522#false} is VALID [2022-04-27 15:31:30,571 INFO L290 TraceCheckUtils]: 101: Hoare triple {26522#false} assume 8 == ~blastFlag~0; {26522#false} is VALID [2022-04-27 15:31:30,572 INFO L290 TraceCheckUtils]: 102: Hoare triple {26522#false} assume !false; {26522#false} is VALID [2022-04-27 15:31:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:31:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727226381] [2022-04-27 15:31:30,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727226381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:30,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:30,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287759532] [2022-04-27 15:31:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:30,573 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 103 [2022-04-27 15:31:30,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:30,573 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-27 15:31:30,643 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-27 15:31:30,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:30,645 INFO L87 Difference]: Start difference. First operand 299 states and 457 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-27 15:31:32,419 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-27 15:31:36,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:37,173 INFO L93 Difference]: Finished difference Result 589 states and 907 transitions. [2022-04-27 15:31:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:37,173 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 103 [2022-04-27 15:31:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:37,173 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-27 15:31:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:31:37,175 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-27 15:31:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-27 15:31:37,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-27 15:31:37,473 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-27 15:31:37,477 INFO L225 Difference]: With dead ends: 589 [2022-04-27 15:31:37,477 INFO L226 Difference]: Without dead ends: 316 [2022-04-27 15:31:37,478 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-27 15:31:37,478 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 36 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:37,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 15:31:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-27 15:31:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 299. [2022-04-27 15:31:37,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:37,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:37,484 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:37,485 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:37,490 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:31:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:31:37,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:37,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:37,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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 316 states. [2022-04-27 15:31:37,492 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 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 316 states. [2022-04-27 15:31:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:37,497 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-04-27 15:31:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 479 transitions. [2022-04-27 15:31:37,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:37,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:37,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:37,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.5374149659863945) internal successors, (452), 294 states have internal predecessors, (452), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 456 transitions. [2022-04-27 15:31:37,504 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 456 transitions. Word has length 103 [2022-04-27 15:31:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:37,504 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 456 transitions. [2022-04-27 15:31:37,504 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-27 15:31:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 456 transitions. [2022-04-27 15:31:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-27 15:31:37,505 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:37,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:37,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:31:37,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1486400636, now seen corresponding path program 1 times [2022-04-27 15:31:37,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:37,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427961345] [2022-04-27 15:31:37,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:37,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {28176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28169#true} is VALID [2022-04-27 15:31:37,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-27 15:31:37,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28169#true} {28169#true} #689#return; {28169#true} is VALID [2022-04-27 15:31:37,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {28169#true} call ULTIMATE.init(); {28176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:37,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {28176#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {28169#true} assume true; {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28169#true} {28169#true} #689#return; {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {28169#true} call #t~ret161 := main(); {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {28169#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {28169#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L272 TraceCheckUtils]: 7: Hoare triple {28169#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {28169#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {28169#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {28169#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {28169#true} is VALID [2022-04-27 15:31:37,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {28169#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {28169#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {28169#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {28169#true} assume !false; {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {28169#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {28169#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {28169#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {28169#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {28169#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {28169#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {28169#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {28169#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {28169#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28169#true} is VALID [2022-04-27 15:31:37,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {28169#true} assume 8464 == #t~mem55;havoc #t~mem55; {28169#true} is VALID [2022-04-27 15:31:37,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {28169#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {28169#true} is VALID [2022-04-27 15:31:37,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {28169#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28169#true} is VALID [2022-04-27 15:31:37,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {28169#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:37,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {28174#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28175#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {28175#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {28170#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {28170#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {28170#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {28170#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {28170#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {28170#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {28170#false} assume 12292 != #t~mem85;havoc #t~mem85; {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {28170#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {28170#false} is VALID [2022-04-27 15:31:37,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {28170#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {28170#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 49: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {28170#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {28170#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {28170#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 53: Hoare triple {28170#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {28170#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {28170#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {28170#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {28170#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {28170#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 59: Hoare triple {28170#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {28170#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {28170#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {28170#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {28170#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {28170#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {28170#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {28170#false} assume 8528 == #t~mem62;havoc #t~mem62; {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {28170#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 68: Hoare triple {28170#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {28170#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {28170#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 71: Hoare triple {28170#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {28170#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {28170#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {28170#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 75: Hoare triple {28170#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 76: Hoare triple {28170#false} ~skip~0 := 0; {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {28170#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {28170#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 80: Hoare triple {28170#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 81: Hoare triple {28170#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {28170#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 83: Hoare triple {28170#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {28170#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {28170#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 86: Hoare triple {28170#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 87: Hoare triple {28170#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {28170#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 89: Hoare triple {28170#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 90: Hoare triple {28170#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 91: Hoare triple {28170#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 92: Hoare triple {28170#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 93: Hoare triple {28170#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,644 INFO L290 TraceCheckUtils]: 94: Hoare triple {28170#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 95: Hoare triple {28170#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 96: Hoare triple {28170#false} assume 8544 == #t~mem64;havoc #t~mem64; {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 97: Hoare triple {28170#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 98: Hoare triple {28170#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 99: Hoare triple {28170#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 100: Hoare triple {28170#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 101: Hoare triple {28170#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 102: Hoare triple {28170#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 103: Hoare triple {28170#false} assume 8 == ~blastFlag~0; {28170#false} is VALID [2022-04-27 15:31:37,645 INFO L290 TraceCheckUtils]: 104: Hoare triple {28170#false} assume !false; {28170#false} is VALID [2022-04-27 15:31:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 15:31:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:37,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427961345] [2022-04-27 15:31:37,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427961345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:37,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:37,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:37,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557834036] [2022-04-27 15:31:37,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:37,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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-27 15:31:37,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:37,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:37,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:37,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:37,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:37,715 INFO L87 Difference]: Start difference. First operand 299 states and 456 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:41,985 INFO L93 Difference]: Finished difference Result 579 states and 892 transitions. [2022-04-27 15:31:41,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:41,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 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-27 15:31:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:31:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-27 15:31:41,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-27 15:31:42,274 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-27 15:31:42,278 INFO L225 Difference]: With dead ends: 579 [2022-04-27 15:31:42,278 INFO L226 Difference]: Without dead ends: 306 [2022-04-27 15:31:42,279 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-27 15:31:42,279 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:42,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 525 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 15:31:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-27 15:31:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2022-04-27 15:31:42,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:42,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,285 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,285 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:42,290 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:31:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:31:42,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:42,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:42,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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 306 states. [2022-04-27 15:31:42,292 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 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 306 states. [2022-04-27 15:31:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:42,297 INFO L93 Difference]: Finished difference Result 306 states and 465 transitions. [2022-04-27 15:31:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 465 transitions. [2022-04-27 15:31:42,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:42,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:42,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:42,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.534013605442177) internal successors, (451), 294 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 455 transitions. [2022-04-27 15:31:42,304 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 455 transitions. Word has length 105 [2022-04-27 15:31:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:42,304 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 455 transitions. [2022-04-27 15:31:42,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 455 transitions. [2022-04-27 15:31:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:31:42,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:42,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:31:42,306 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -541256236, now seen corresponding path program 1 times [2022-04-27 15:31:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221342288] [2022-04-27 15:31:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:42,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {29793#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29786#true} is VALID [2022-04-27 15:31:42,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-27 15:31:42,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29786#true} {29786#true} #689#return; {29786#true} is VALID [2022-04-27 15:31:42,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {29786#true} call ULTIMATE.init(); {29793#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:42,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {29793#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29786#true} is VALID [2022-04-27 15:31:42,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {29786#true} assume true; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29786#true} {29786#true} #689#return; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {29786#true} call #t~ret161 := main(); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {29786#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {29786#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {29786#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {29786#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {29786#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {29786#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {29786#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {29786#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {29786#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29786#true} is VALID [2022-04-27 15:31:42,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {29786#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {29786#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {29786#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {29786#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {29786#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {29786#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {29786#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {29786#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {29786#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {29786#true} assume 8464 == #t~mem55;havoc #t~mem55; {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {29786#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {29786#true} is VALID [2022-04-27 15:31:42,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {29786#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {29786#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {29786#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {29786#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {29786#true} ~skip~0 := 0; {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {29786#true} assume !false; {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {29786#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {29786#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {29786#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {29786#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {29786#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {29786#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {29786#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {29786#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {29786#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {29786#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {29786#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {29786#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {29786#true} assume 8496 == #t~mem58;havoc #t~mem58; {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {29786#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {29786#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {29786#true} is VALID [2022-04-27 15:31:42,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {29786#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {29786#true} is VALID [2022-04-27 15:31:42,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {29786#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,448 INFO L290 TraceCheckUtils]: 50: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,449 INFO L290 TraceCheckUtils]: 51: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,449 INFO L290 TraceCheckUtils]: 52: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,452 INFO L290 TraceCheckUtils]: 59: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,452 INFO L290 TraceCheckUtils]: 60: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 69: Hoare triple {29791#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29792#(= |ssl3_accept_#t~mem62| 8656)} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 70: Hoare triple {29792#(= |ssl3_accept_#t~mem62| 8656)} assume 8528 == #t~mem62;havoc #t~mem62; {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 71: Hoare triple {29787#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {29787#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {29787#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 74: Hoare triple {29787#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {29787#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {29787#false} is VALID [2022-04-27 15:31:42,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {29787#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {29787#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {29787#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 79: Hoare triple {29787#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 80: Hoare triple {29787#false} ~skip~0 := 0; {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 81: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 82: Hoare triple {29787#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 83: Hoare triple {29787#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {29787#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {29787#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {29787#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 87: Hoare triple {29787#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,457 INFO L290 TraceCheckUtils]: 88: Hoare triple {29787#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {29787#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 90: Hoare triple {29787#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 91: Hoare triple {29787#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {29787#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {29787#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {29787#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 95: Hoare triple {29787#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 96: Hoare triple {29787#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 97: Hoare triple {29787#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 98: Hoare triple {29787#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 99: Hoare triple {29787#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,458 INFO L290 TraceCheckUtils]: 100: Hoare triple {29787#false} assume 8544 == #t~mem64;havoc #t~mem64; {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 101: Hoare triple {29787#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 102: Hoare triple {29787#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 103: Hoare triple {29787#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {29787#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {29787#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 106: Hoare triple {29787#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 107: Hoare triple {29787#false} assume 8 == ~blastFlag~0; {29787#false} is VALID [2022-04-27 15:31:42,459 INFO L290 TraceCheckUtils]: 108: Hoare triple {29787#false} assume !false; {29787#false} is VALID [2022-04-27 15:31:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:31:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:42,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221342288] [2022-04-27 15:31:42,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221342288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:42,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:42,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017519532] [2022-04-27 15:31:42,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:31:42,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:42,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:42,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:42,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:42,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:42,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:42,545 INFO L87 Difference]: Start difference. First operand 299 states and 455 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:47,740 INFO L93 Difference]: Finished difference Result 661 states and 1011 transitions. [2022-04-27 15:31:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:31:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-04-27 15:31:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-04-27 15:31:47,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 542 transitions. [2022-04-27 15:31:48,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:48,097 INFO L225 Difference]: With dead ends: 661 [2022-04-27 15:31:48,097 INFO L226 Difference]: Without dead ends: 388 [2022-04-27 15:31:48,098 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-27 15:31:48,098 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 84 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:48,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 493 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:31:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-04-27 15:31:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 327. [2022-04-27 15:31:48,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:48,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,106 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,106 INFO L87 Difference]: Start difference. First operand 388 states. Second operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:48,114 INFO L93 Difference]: Finished difference Result 388 states and 585 transitions. [2022-04-27 15:31:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 585 transitions. [2022-04-27 15:31:48,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:48,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:48,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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 388 states. [2022-04-27 15:31:48,116 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 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 388 states. [2022-04-27 15:31:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:48,124 INFO L93 Difference]: Finished difference Result 388 states and 585 transitions. [2022-04-27 15:31:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 585 transitions. [2022-04-27 15:31:48,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:48,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:48,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:48,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.531055900621118) internal successors, (493), 322 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 497 transitions. [2022-04-27 15:31:48,132 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 497 transitions. Word has length 109 [2022-04-27 15:31:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:48,132 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 497 transitions. [2022-04-27 15:31:48,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 497 transitions. [2022-04-27 15:31:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-27 15:31:48,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:48,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:48,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:31:48,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:48,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1420318422, now seen corresponding path program 1 times [2022-04-27 15:31:48,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:48,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859085625] [2022-04-27 15:31:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:48,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {31698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31691#true} is VALID [2022-04-27 15:31:48,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {31691#true} assume true; {31691#true} is VALID [2022-04-27 15:31:48,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31691#true} {31691#true} #689#return; {31691#true} is VALID [2022-04-27 15:31:48,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {31691#true} call ULTIMATE.init(); {31698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:48,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {31698#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {31691#true} assume true; {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31691#true} {31691#true} #689#return; {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {31691#true} call #t~ret161 := main(); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {31691#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {31691#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L272 TraceCheckUtils]: 7: Hoare triple {31691#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {31691#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {31691#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {31691#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {31691#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {31691#true} is VALID [2022-04-27 15:31:48,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {31691#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {31691#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {31691#true} assume !false; {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {31691#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {31691#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {31691#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {31691#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {31691#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {31691#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {31691#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {31691#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {31691#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {31691#true} assume 8464 == #t~mem55;havoc #t~mem55; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {31691#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {31691#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {31691#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {31691#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {31691#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {31691#true} ~skip~0 := 0; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {31691#true} assume !false; {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {31691#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {31691#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {31691#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {31691#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {31691#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {31691#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {31691#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {31691#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {31691#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {31691#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 42: Hoare triple {31691#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {31691#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {31691#true} assume 8496 == #t~mem58;havoc #t~mem58; {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {31691#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 46: Hoare triple {31691#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {31691#true} is VALID [2022-04-27 15:31:48,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {31691#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {31691#true} is VALID [2022-04-27 15:31:48,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {31691#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,289 INFO L290 TraceCheckUtils]: 50: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,290 INFO L290 TraceCheckUtils]: 51: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,297 INFO L290 TraceCheckUtils]: 68: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:31:48,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {31696#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31697#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-27 15:31:48,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {31697#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {31692#false} is VALID [2022-04-27 15:31:48,297 INFO L290 TraceCheckUtils]: 71: Hoare triple {31692#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {31692#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 73: Hoare triple {31692#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 74: Hoare triple {31692#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 75: Hoare triple {31692#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {31692#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {31692#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 78: Hoare triple {31692#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 79: Hoare triple {31692#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 80: Hoare triple {31692#false} ~skip~0 := 0; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 81: Hoare triple {31692#false} assume !false; {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 82: Hoare triple {31692#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {31692#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {31692#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 85: Hoare triple {31692#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {31692#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 87: Hoare triple {31692#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {31692#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 89: Hoare triple {31692#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 90: Hoare triple {31692#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 91: Hoare triple {31692#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 92: Hoare triple {31692#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 93: Hoare triple {31692#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 94: Hoare triple {31692#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 95: Hoare triple {31692#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,299 INFO L290 TraceCheckUtils]: 96: Hoare triple {31692#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 97: Hoare triple {31692#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 98: Hoare triple {31692#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 99: Hoare triple {31692#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 100: Hoare triple {31692#false} assume 8544 == #t~mem64;havoc #t~mem64; {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 101: Hoare triple {31692#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {31692#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {31692#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 104: Hoare triple {31692#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 105: Hoare triple {31692#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 106: Hoare triple {31692#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 107: Hoare triple {31692#false} assume 8 == ~blastFlag~0; {31692#false} is VALID [2022-04-27 15:31:48,300 INFO L290 TraceCheckUtils]: 108: Hoare triple {31692#false} assume !false; {31692#false} is VALID [2022-04-27 15:31:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:31:48,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:48,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859085625] [2022-04-27 15:31:48,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859085625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:48,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:48,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153770529] [2022-04-27 15:31:48,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:31:48,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:48,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:48,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:31:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:48,377 INFO L87 Difference]: Start difference. First operand 327 states and 497 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:50,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:31:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:54,770 INFO L93 Difference]: Finished difference Result 745 states and 1138 transitions. [2022-04-27 15:31:54,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:31:54,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 109 [2022-04-27 15:31:54,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:31:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:31:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:31:54,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:31:55,174 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-27 15:31:55,186 INFO L225 Difference]: With dead ends: 745 [2022-04-27 15:31:55,186 INFO L226 Difference]: Without dead ends: 444 [2022-04-27 15:31:55,187 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-27 15:31:55,187 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 131 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:31:55,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-27 15:31:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-04-27 15:31:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 325. [2022-04-27 15:31:55,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:31:55,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:55,212 INFO L74 IsIncluded]: Start isIncluded. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:55,213 INFO L87 Difference]: Start difference. First operand 444 states. Second operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:55,224 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-27 15:31:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-27 15:31:55,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:55,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:55,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 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 444 states. [2022-04-27 15:31:55,226 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 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 444 states. [2022-04-27 15:31:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:31:55,237 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2022-04-27 15:31:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 668 transitions. [2022-04-27 15:31:55,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:31:55,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:31:55,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:31:55,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:31:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.528125) internal successors, (489), 320 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 493 transitions. [2022-04-27 15:31:55,244 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 493 transitions. Word has length 109 [2022-04-27 15:31:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:31:55,245 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 493 transitions. [2022-04-27 15:31:55,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:31:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 493 transitions. [2022-04-27 15:31:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:31:55,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:31:55,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:31:55,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:31:55,253 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:31:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:31:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1022958803, now seen corresponding path program 1 times [2022-04-27 15:31:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:31:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670243760] [2022-04-27 15:31:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:31:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:31:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:31:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:31:55,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {33808#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33801#true} is VALID [2022-04-27 15:31:55,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {33801#true} assume true; {33801#true} is VALID [2022-04-27 15:31:55,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33801#true} {33801#true} #689#return; {33801#true} is VALID [2022-04-27 15:31:55,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {33801#true} call ULTIMATE.init(); {33808#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:31:55,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {33808#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33801#true} is VALID [2022-04-27 15:31:55,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {33801#true} assume true; {33801#true} is VALID [2022-04-27 15:31:55,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33801#true} {33801#true} #689#return; {33801#true} is VALID [2022-04-27 15:31:55,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {33801#true} call #t~ret161 := main(); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {33801#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {33801#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L272 TraceCheckUtils]: 7: Hoare triple {33801#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {33801#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {33801#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {33801#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {33801#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {33801#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {33801#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {33801#true} assume !false; {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {33801#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {33801#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {33801#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {33801#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {33801#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {33801#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {33801#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {33801#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {33801#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {33801#true} assume 8464 == #t~mem55;havoc #t~mem55; {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {33801#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {33801#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {33801#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {33801#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {33801#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {33801#true} ~skip~0 := 0; {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {33801#true} assume !false; {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {33801#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {33801#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {33801#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {33801#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {33801#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {33801#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {33801#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {33801#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {33801#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {33801#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,393 INFO L290 TraceCheckUtils]: 42: Hoare triple {33801#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {33801#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {33801#true} assume 8496 == #t~mem58;havoc #t~mem58; {33801#true} is VALID [2022-04-27 15:31:55,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {33801#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33801#true} is VALID [2022-04-27 15:31:55,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {33801#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {33801#true} is VALID [2022-04-27 15:31:55,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {33801#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33801#true} is VALID [2022-04-27 15:31:55,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {33801#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,400 INFO L290 TraceCheckUtils]: 62: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,403 INFO L290 TraceCheckUtils]: 69: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:31:55,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {33806#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33807#(= |ssl3_accept_#t~mem63| 8656)} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 71: Hoare triple {33807#(= |ssl3_accept_#t~mem63| 8656)} assume 8529 == #t~mem63;havoc #t~mem63; {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 72: Hoare triple {33802#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 73: Hoare triple {33802#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {33802#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {33802#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {33802#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {33802#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {33802#false} is VALID [2022-04-27 15:31:55,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {33802#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 79: Hoare triple {33802#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 80: Hoare triple {33802#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 81: Hoare triple {33802#false} ~skip~0 := 0; {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 82: Hoare triple {33802#false} assume !false; {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 83: Hoare triple {33802#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 84: Hoare triple {33802#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 85: Hoare triple {33802#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 86: Hoare triple {33802#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 87: Hoare triple {33802#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 88: Hoare triple {33802#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 89: Hoare triple {33802#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 90: Hoare triple {33802#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,405 INFO L290 TraceCheckUtils]: 91: Hoare triple {33802#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 92: Hoare triple {33802#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 93: Hoare triple {33802#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {33802#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 95: Hoare triple {33802#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 96: Hoare triple {33802#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 97: Hoare triple {33802#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 98: Hoare triple {33802#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 99: Hoare triple {33802#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 100: Hoare triple {33802#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 101: Hoare triple {33802#false} assume 8544 == #t~mem64;havoc #t~mem64; {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 102: Hoare triple {33802#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 103: Hoare triple {33802#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,406 INFO L290 TraceCheckUtils]: 104: Hoare triple {33802#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L290 TraceCheckUtils]: 105: Hoare triple {33802#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L290 TraceCheckUtils]: 106: Hoare triple {33802#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L290 TraceCheckUtils]: 107: Hoare triple {33802#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L290 TraceCheckUtils]: 108: Hoare triple {33802#false} assume 8 == ~blastFlag~0; {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {33802#false} assume !false; {33802#false} is VALID [2022-04-27 15:31:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-27 15:31:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:31:55,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670243760] [2022-04-27 15:31:55,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670243760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:31:55,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:31:55,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:31:55,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375066006] [2022-04-27 15:31:55,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:31:55,408 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-27 15:31:55,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:31:55,409 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-27 15:31:55,484 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-27 15:31:55,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:31:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:31:55,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:31:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:31:55,486 INFO L87 Difference]: Start difference. First operand 325 states and 493 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-27 15:31:57,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:01,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:03,009 INFO L93 Difference]: Finished difference Result 711 states and 1083 transitions. [2022-04-27 15:32:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:03,010 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-27 15:32:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:03,010 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-27 15:32:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:32:03,013 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-27 15:32:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-04-27 15:32:03,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 538 transitions. [2022-04-27 15:32:03,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 538 edges. 538 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:03,369 INFO L225 Difference]: With dead ends: 711 [2022-04-27 15:32:03,369 INFO L226 Difference]: Without dead ends: 412 [2022-04-27 15:32:03,370 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-27 15:32:03,371 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 81 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:03,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 493 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 15:32:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-27 15:32:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 354. [2022-04-27 15:32:03,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:03,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:03,379 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:03,380 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:03,388 INFO L93 Difference]: Finished difference Result 412 states and 619 transitions. [2022-04-27 15:32:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 619 transitions. [2022-04-27 15:32:03,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:03,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:03,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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 412 states. [2022-04-27 15:32:03,390 INFO L87 Difference]: Start difference. First operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 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 412 states. [2022-04-27 15:32:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:03,399 INFO L93 Difference]: Finished difference Result 412 states and 619 transitions. [2022-04-27 15:32:03,399 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 619 transitions. [2022-04-27 15:32:03,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:03,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:03,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:03,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 536 transitions. [2022-04-27 15:32:03,407 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 536 transitions. Word has length 110 [2022-04-27 15:32:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:03,407 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 536 transitions. [2022-04-27 15:32:03,407 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-27 15:32:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 536 transitions. [2022-04-27 15:32:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:32:03,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:03,408 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-27 15:32:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:32:03,409 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 1 times [2022-04-27 15:32:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:03,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618052767] [2022-04-27 15:32:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:03,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:03,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {35843#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35836#true} is VALID [2022-04-27 15:32:03,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {35836#true} assume true; {35836#true} is VALID [2022-04-27 15:32:03,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35836#true} {35836#true} #689#return; {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {35836#true} call ULTIMATE.init(); {35843#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:03,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {35843#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {35836#true} assume true; {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35836#true} {35836#true} #689#return; {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {35836#true} call #t~ret161 := main(); {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {35836#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {35836#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,555 INFO L272 TraceCheckUtils]: 7: Hoare triple {35836#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {35836#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {35836#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {35836#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {35836#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {35836#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {35836#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {35836#true} assume !false; {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {35836#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {35836#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {35836#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {35836#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {35836#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {35836#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {35836#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {35836#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {35836#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {35836#true} assume 8464 == #t~mem55;havoc #t~mem55; {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {35836#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {35836#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {35836#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {35836#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {35836#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {35836#true} ~skip~0 := 0; {35836#true} is VALID [2022-04-27 15:32:03,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {35836#true} assume !false; {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {35836#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {35836#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {35836#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {35836#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {35836#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {35836#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {35836#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {35836#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {35836#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 41: Hoare triple {35836#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {35836#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {35836#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {35836#true} assume 8496 == #t~mem58;havoc #t~mem58; {35836#true} is VALID [2022-04-27 15:32:03,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {35836#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {35836#true} is VALID [2022-04-27 15:32:03,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {35836#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {35836#true} is VALID [2022-04-27 15:32:03,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {35836#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {35836#true} is VALID [2022-04-27 15:32:03,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {35836#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,569 INFO L290 TraceCheckUtils]: 70: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,570 INFO L290 TraceCheckUtils]: 72: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,570 INFO L290 TraceCheckUtils]: 73: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,571 INFO L290 TraceCheckUtils]: 74: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:03,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {35841#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {35842#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 76: Hoare triple {35842#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 77: Hoare triple {35837#false} assume !(~num1~0 > 0); {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {35837#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 79: Hoare triple {35837#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 80: Hoare triple {35837#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 81: Hoare triple {35837#false} ~skip~0 := 0; {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 82: Hoare triple {35837#false} assume !false; {35837#false} is VALID [2022-04-27 15:32:03,572 INFO L290 TraceCheckUtils]: 83: Hoare triple {35837#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {35837#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 85: Hoare triple {35837#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 86: Hoare triple {35837#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {35837#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 88: Hoare triple {35837#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 89: Hoare triple {35837#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 90: Hoare triple {35837#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 91: Hoare triple {35837#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 92: Hoare triple {35837#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {35837#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {35837#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {35837#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {35837#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {35837#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 98: Hoare triple {35837#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 99: Hoare triple {35837#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 100: Hoare triple {35837#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 101: Hoare triple {35837#false} assume 8544 == #t~mem64;havoc #t~mem64; {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 102: Hoare triple {35837#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 103: Hoare triple {35837#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 104: Hoare triple {35837#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {35837#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {35837#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {35837#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {35837#false} is VALID [2022-04-27 15:32:03,574 INFO L290 TraceCheckUtils]: 108: Hoare triple {35837#false} assume 8 == ~blastFlag~0; {35837#false} is VALID [2022-04-27 15:32:03,575 INFO L290 TraceCheckUtils]: 109: Hoare triple {35837#false} assume !false; {35837#false} is VALID [2022-04-27 15:32:03,575 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-27 15:32:03,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618052767] [2022-04-27 15:32:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618052767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:03,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:03,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590670151] [2022-04-27 15:32:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:03,577 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-27 15:32:03,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:03,577 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-27 15:32:03,668 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-27 15:32:03,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:03,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:03,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:03,669 INFO L87 Difference]: Start difference. First operand 354 states and 536 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-27 15:32:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:07,919 INFO L93 Difference]: Finished difference Result 737 states and 1121 transitions. [2022-04-27 15:32:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:07,919 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-27 15:32:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:07,920 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-27 15:32:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-27 15:32:07,922 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-27 15:32:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-27 15:32:07,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 533 transitions. [2022-04-27 15:32:08,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:08,277 INFO L225 Difference]: With dead ends: 737 [2022-04-27 15:32:08,277 INFO L226 Difference]: Without dead ends: 409 [2022-04-27 15:32:08,278 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-27 15:32:08,279 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 74 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:08,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 499 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:32:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-04-27 15:32:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 359. [2022-04-27 15:32:08,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:08,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:08,287 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:08,287 INFO L87 Difference]: Start difference. First operand 409 states. Second operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:08,296 INFO L93 Difference]: Finished difference Result 409 states and 614 transitions. [2022-04-27 15:32:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 614 transitions. [2022-04-27 15:32:08,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:08,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:08,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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 409 states. [2022-04-27 15:32:08,297 INFO L87 Difference]: Start difference. First operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 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 409 states. [2022-04-27 15:32:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:08,315 INFO L93 Difference]: Finished difference Result 409 states and 614 transitions. [2022-04-27 15:32:08,315 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 614 transitions. [2022-04-27 15:32:08,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:08,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:08,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:08,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.5225988700564972) internal successors, (539), 354 states have internal predecessors, (539), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2022-04-27 15:32:08,323 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 110 [2022-04-27 15:32:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:08,323 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2022-04-27 15:32:08,324 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-27 15:32:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2022-04-27 15:32:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-27 15:32:08,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:08,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:32:08,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:32:08,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash -343686549, now seen corresponding path program 1 times [2022-04-27 15:32:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:08,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875436541] [2022-04-27 15:32:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:08,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {37904#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37897#true} is VALID [2022-04-27 15:32:08,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {37897#true} assume true; {37897#true} is VALID [2022-04-27 15:32:08,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37897#true} {37897#true} #689#return; {37897#true} is VALID [2022-04-27 15:32:08,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {37897#true} call ULTIMATE.init(); {37904#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:08,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {37904#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37897#true} is VALID [2022-04-27 15:32:08,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {37897#true} assume true; {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37897#true} {37897#true} #689#return; {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {37897#true} call #t~ret161 := main(); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {37897#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {37897#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L272 TraceCheckUtils]: 7: Hoare triple {37897#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {37897#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {37897#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {37897#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {37897#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {37897#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {37897#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {37897#true} assume !false; {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {37897#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {37897#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {37897#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {37897#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {37897#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {37897#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {37897#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {37897#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {37897#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {37897#true} assume 8464 == #t~mem55;havoc #t~mem55; {37897#true} is VALID [2022-04-27 15:32:08,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {37897#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {37897#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {37897#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {37897#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {37897#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {37897#true} ~skip~0 := 0; {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {37897#true} assume !false; {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {37897#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {37897#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {37897#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {37897#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {37897#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {37897#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {37897#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {37897#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {37897#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {37897#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {37897#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {37897#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {37897#true} assume 8496 == #t~mem58;havoc #t~mem58; {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {37897#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {37897#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {37897#true} is VALID [2022-04-27 15:32:08,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {37897#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {37897#true} is VALID [2022-04-27 15:32:08,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {37897#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,462 INFO L290 TraceCheckUtils]: 55: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,463 INFO L290 TraceCheckUtils]: 57: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,465 INFO L290 TraceCheckUtils]: 63: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:08,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {37902#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37903#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:32:08,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {37903#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {37898#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {37898#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {37898#false} assume 8529 == #t~mem63;havoc #t~mem63; {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {37898#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {37898#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {37898#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {37898#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 76: Hoare triple {37898#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {37898#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 78: Hoare triple {37898#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 79: Hoare triple {37898#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 80: Hoare triple {37898#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37898#false} is VALID [2022-04-27 15:32:08,468 INFO L290 TraceCheckUtils]: 81: Hoare triple {37898#false} ~skip~0 := 0; {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 82: Hoare triple {37898#false} assume !false; {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 83: Hoare triple {37898#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 84: Hoare triple {37898#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 85: Hoare triple {37898#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 86: Hoare triple {37898#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 87: Hoare triple {37898#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 88: Hoare triple {37898#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {37898#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {37898#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 91: Hoare triple {37898#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 92: Hoare triple {37898#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {37898#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 94: Hoare triple {37898#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 95: Hoare triple {37898#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {37898#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {37898#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {37898#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 99: Hoare triple {37898#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 100: Hoare triple {37898#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 101: Hoare triple {37898#false} assume 8544 == #t~mem64;havoc #t~mem64; {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 102: Hoare triple {37898#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 103: Hoare triple {37898#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 104: Hoare triple {37898#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37898#false} is VALID [2022-04-27 15:32:08,470 INFO L290 TraceCheckUtils]: 105: Hoare triple {37898#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {37898#false} is VALID [2022-04-27 15:32:08,471 INFO L290 TraceCheckUtils]: 106: Hoare triple {37898#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37898#false} is VALID [2022-04-27 15:32:08,471 INFO L290 TraceCheckUtils]: 107: Hoare triple {37898#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {37898#false} is VALID [2022-04-27 15:32:08,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {37898#false} assume 8 == ~blastFlag~0; {37898#false} is VALID [2022-04-27 15:32:08,471 INFO L290 TraceCheckUtils]: 109: Hoare triple {37898#false} assume !false; {37898#false} is VALID [2022-04-27 15:32:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-27 15:32:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875436541] [2022-04-27 15:32:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875436541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:08,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039342128] [2022-04-27 15:32:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 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-27 15:32:08,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:08,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:08,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:08,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:08,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:08,557 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:14,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:15,158 INFO L93 Difference]: Finished difference Result 738 states and 1123 transitions. [2022-04-27 15:32:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 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-27 15:32:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:32:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-27 15:32:15,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-27 15:32:15,548 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-27 15:32:15,557 INFO L225 Difference]: With dead ends: 738 [2022-04-27 15:32:15,557 INFO L226 Difference]: Without dead ends: 405 [2022-04-27 15:32:15,558 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-27 15:32:15,558 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 36 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:15,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 603 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 15:32:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-27 15:32:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 383. [2022-04-27 15:32:15,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:15,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,566 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,566 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:15,575 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:32:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:32:15,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:15,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:15,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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 405 states. [2022-04-27 15:32:15,576 INFO L87 Difference]: Start difference. First operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 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 405 states. [2022-04-27 15:32:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:15,585 INFO L93 Difference]: Finished difference Result 405 states and 609 transitions. [2022-04-27 15:32:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 609 transitions. [2022-04-27 15:32:15,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:15,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:15,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:15,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 378 states have (on average 1.5211640211640212) internal successors, (575), 378 states have internal predecessors, (575), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 579 transitions. [2022-04-27 15:32:15,594 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 579 transitions. Word has length 110 [2022-04-27 15:32:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:15,594 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 579 transitions. [2022-04-27 15:32:15,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 579 transitions. [2022-04-27 15:32:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-27 15:32:15,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:15,595 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-27 15:32:15,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:32:15,595 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:15,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 1 times [2022-04-27 15:32:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:15,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931113138] [2022-04-27 15:32:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:15,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {39980#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39973#true} is VALID [2022-04-27 15:32:15,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {39973#true} assume true; {39973#true} is VALID [2022-04-27 15:32:15,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39973#true} {39973#true} #689#return; {39973#true} is VALID [2022-04-27 15:32:15,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {39973#true} call ULTIMATE.init(); {39980#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:15,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {39980#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {39973#true} assume true; {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39973#true} {39973#true} #689#return; {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {39973#true} call #t~ret161 := main(); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {39973#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {39973#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {39973#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {39973#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {39973#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {39973#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {39973#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {39973#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {39973#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {39973#true} assume !false; {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {39973#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {39973#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {39973#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {39973#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {39973#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {39973#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {39973#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {39973#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {39973#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {39973#true} assume 8464 == #t~mem55;havoc #t~mem55; {39973#true} is VALID [2022-04-27 15:32:15,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {39973#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {39973#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {39973#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {39973#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {39973#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {39973#true} ~skip~0 := 0; {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {39973#true} assume !false; {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {39973#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {39973#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {39973#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {39973#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {39973#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {39973#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {39973#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {39973#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {39973#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {39973#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {39973#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {39973#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {39973#true} assume 8496 == #t~mem58;havoc #t~mem58; {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {39973#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {39973#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {39973#true} is VALID [2022-04-27 15:32:15,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {39973#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {39973#true} is VALID [2022-04-27 15:32:15,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {39973#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,735 INFO L290 TraceCheckUtils]: 55: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,737 INFO L290 TraceCheckUtils]: 59: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,737 INFO L290 TraceCheckUtils]: 60: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,741 INFO L290 TraceCheckUtils]: 68: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,741 INFO L290 TraceCheckUtils]: 69: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,741 INFO L290 TraceCheckUtils]: 70: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,742 INFO L290 TraceCheckUtils]: 71: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,742 INFO L290 TraceCheckUtils]: 72: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,743 INFO L290 TraceCheckUtils]: 75: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,744 INFO L290 TraceCheckUtils]: 76: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,744 INFO L290 TraceCheckUtils]: 77: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,745 INFO L290 TraceCheckUtils]: 78: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,745 INFO L290 TraceCheckUtils]: 79: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:15,746 INFO L290 TraceCheckUtils]: 80: Hoare triple {39978#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39979#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-27 15:32:15,746 INFO L290 TraceCheckUtils]: 81: Hoare triple {39979#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {39974#false} is VALID [2022-04-27 15:32:15,746 INFO L290 TraceCheckUtils]: 82: Hoare triple {39974#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {39974#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {39974#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {39974#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {39974#false} ~skip~0 := 0; {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {39974#false} assume !false; {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {39974#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {39974#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 90: Hoare triple {39974#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 91: Hoare triple {39974#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 92: Hoare triple {39974#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 93: Hoare triple {39974#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,747 INFO L290 TraceCheckUtils]: 94: Hoare triple {39974#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 95: Hoare triple {39974#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 96: Hoare triple {39974#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 97: Hoare triple {39974#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 98: Hoare triple {39974#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 99: Hoare triple {39974#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 100: Hoare triple {39974#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 101: Hoare triple {39974#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 102: Hoare triple {39974#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 103: Hoare triple {39974#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 104: Hoare triple {39974#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 105: Hoare triple {39974#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 106: Hoare triple {39974#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,748 INFO L290 TraceCheckUtils]: 107: Hoare triple {39974#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 108: Hoare triple {39974#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 109: Hoare triple {39974#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 110: Hoare triple {39974#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 111: Hoare triple {39974#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 112: Hoare triple {39974#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 113: Hoare triple {39974#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 114: Hoare triple {39974#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 115: Hoare triple {39974#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {39974#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 117: Hoare triple {39974#false} assume 8640 == #t~mem75;havoc #t~mem75; {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 118: Hoare triple {39974#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 119: Hoare triple {39974#false} assume 4 == ~blastFlag~0; {39974#false} is VALID [2022-04-27 15:32:15,749 INFO L290 TraceCheckUtils]: 120: Hoare triple {39974#false} assume !false; {39974#false} is VALID [2022-04-27 15:32:15,750 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-27 15:32:15,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:15,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931113138] [2022-04-27 15:32:15,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931113138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:15,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:15,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991538642] [2022-04-27 15:32:15,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:15,751 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-27 15:32:15,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:15,751 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-27 15:32:15,842 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-27 15:32:15,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:15,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:15,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:15,843 INFO L87 Difference]: Start difference. First operand 383 states and 579 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-27 15:32:20,630 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-27 15:32:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:21,750 INFO L93 Difference]: Finished difference Result 857 states and 1301 transitions. [2022-04-27 15:32:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:21,751 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-27 15:32:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:21,751 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-27 15:32:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:32:21,753 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-27 15:32:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:32:21,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:32:22,154 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-27 15:32:22,163 INFO L225 Difference]: With dead ends: 857 [2022-04-27 15:32:22,163 INFO L226 Difference]: Without dead ends: 500 [2022-04-27 15:32:22,164 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-27 15:32:22,164 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 346 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-27 15:32:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-04-27 15:32:22,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 420. [2022-04-27 15:32:22,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:22,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:22,173 INFO L74 IsIncluded]: Start isIncluded. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:22,174 INFO L87 Difference]: Start difference. First operand 500 states. Second operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:22,185 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-27 15:32:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-27 15:32:22,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:22,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:22,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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 500 states. [2022-04-27 15:32:22,187 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 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 500 states. [2022-04-27 15:32:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:22,199 INFO L93 Difference]: Finished difference Result 500 states and 750 transitions. [2022-04-27 15:32:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 750 transitions. [2022-04-27 15:32:22,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:22,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:22,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:22,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5253012048192771) internal successors, (633), 415 states have internal predecessors, (633), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 637 transitions. [2022-04-27 15:32:22,210 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 637 transitions. Word has length 121 [2022-04-27 15:32:22,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:22,211 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 637 transitions. [2022-04-27 15:32:22,211 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-27 15:32:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 637 transitions. [2022-04-27 15:32:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-27 15:32:22,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:22,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, 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-27 15:32:22,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:32:22,212 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:22,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 1 times [2022-04-27 15:32:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:22,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347986967] [2022-04-27 15:32:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:22,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {42423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42416#true} is VALID [2022-04-27 15:32:22,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {42416#true} assume true; {42416#true} is VALID [2022-04-27 15:32:22,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42416#true} {42416#true} #689#return; {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {42416#true} call ULTIMATE.init(); {42423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:22,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {42423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {42416#true} assume true; {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42416#true} {42416#true} #689#return; {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {42416#true} call #t~ret161 := main(); {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {42416#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {42416#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,347 INFO L272 TraceCheckUtils]: 7: Hoare triple {42416#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {42416#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {42416#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {42416#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {42416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {42416#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {42416#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {42416#true} assume !false; {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {42416#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {42416#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {42416#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {42416#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {42416#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {42416#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {42416#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {42416#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {42416#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {42416#true} assume 8464 == #t~mem55;havoc #t~mem55; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {42416#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {42416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {42416#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {42416#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {42416#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {42416#true} ~skip~0 := 0; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {42416#true} assume !false; {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {42416#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {42416#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {42416#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {42416#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {42416#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {42416#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {42416#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {42416#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {42416#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {42416#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {42416#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {42416#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {42416#true} assume 8496 == #t~mem58;havoc #t~mem58; {42416#true} is VALID [2022-04-27 15:32:22,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {42416#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {42416#true} is VALID [2022-04-27 15:32:22,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {42416#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {42416#true} is VALID [2022-04-27 15:32:22,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {42416#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {42416#true} is VALID [2022-04-27 15:32:22,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {42416#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,353 INFO L290 TraceCheckUtils]: 51: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,353 INFO L290 TraceCheckUtils]: 52: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,354 INFO L290 TraceCheckUtils]: 53: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,354 INFO L290 TraceCheckUtils]: 55: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,355 INFO L290 TraceCheckUtils]: 58: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,356 INFO L290 TraceCheckUtils]: 59: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,358 INFO L290 TraceCheckUtils]: 64: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,360 INFO L290 TraceCheckUtils]: 69: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,360 INFO L290 TraceCheckUtils]: 70: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,360 INFO L290 TraceCheckUtils]: 71: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,361 INFO L290 TraceCheckUtils]: 72: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,361 INFO L290 TraceCheckUtils]: 73: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,363 INFO L290 TraceCheckUtils]: 77: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,363 INFO L290 TraceCheckUtils]: 78: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,363 INFO L290 TraceCheckUtils]: 79: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,364 INFO L290 TraceCheckUtils]: 80: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-27 15:32:22,364 INFO L290 TraceCheckUtils]: 81: Hoare triple {42421#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42422#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-27 15:32:22,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {42422#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {42417#false} is VALID [2022-04-27 15:32:22,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {42417#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {42417#false} is VALID [2022-04-27 15:32:22,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {42417#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 85: Hoare triple {42417#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 86: Hoare triple {42417#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {42417#false} ~skip~0 := 0; {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 88: Hoare triple {42417#false} assume !false; {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 89: Hoare triple {42417#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 90: Hoare triple {42417#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 91: Hoare triple {42417#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 92: Hoare triple {42417#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 93: Hoare triple {42417#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 94: Hoare triple {42417#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 95: Hoare triple {42417#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 96: Hoare triple {42417#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,365 INFO L290 TraceCheckUtils]: 97: Hoare triple {42417#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 98: Hoare triple {42417#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {42417#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {42417#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {42417#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 102: Hoare triple {42417#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {42417#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {42417#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 105: Hoare triple {42417#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {42417#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 107: Hoare triple {42417#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {42417#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {42417#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {42417#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 111: Hoare triple {42417#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 112: Hoare triple {42417#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 113: Hoare triple {42417#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 114: Hoare triple {42417#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {42417#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 116: Hoare triple {42417#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 117: Hoare triple {42417#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 118: Hoare triple {42417#false} assume 8640 == #t~mem75;havoc #t~mem75; {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 119: Hoare triple {42417#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 120: Hoare triple {42417#false} assume 4 == ~blastFlag~0; {42417#false} is VALID [2022-04-27 15:32:22,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {42417#false} assume !false; {42417#false} is VALID [2022-04-27 15:32:22,368 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-27 15:32:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347986967] [2022-04-27 15:32:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347986967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:22,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507731033] [2022-04-27 15:32:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:22,369 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-27 15:32:22,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:22,370 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-27 15:32:22,456 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-27 15:32:22,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:22,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:22,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:22,457 INFO L87 Difference]: Start difference. First operand 420 states and 637 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-27 15:32:24,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:29,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:30,462 INFO L93 Difference]: Finished difference Result 891 states and 1353 transitions. [2022-04-27 15:32:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:30,462 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-27 15:32:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:30,462 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-27 15:32:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:32:30,465 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-27 15:32:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-04-27 15:32:30,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 588 transitions. [2022-04-27 15:32:30,858 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-27 15:32:30,867 INFO L225 Difference]: With dead ends: 891 [2022-04-27 15:32:30,867 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 15:32:30,868 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-27 15:32:30,869 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:30,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-27 15:32:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 15:32:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-27 15:32:30,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:30,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:30,878 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:30,878 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:30,889 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-27 15:32:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-27 15:32:30,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:30,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:30,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:32:30,890 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:32:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:30,902 INFO L93 Difference]: Finished difference Result 497 states and 744 transitions. [2022-04-27 15:32:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 744 transitions. [2022-04-27 15:32:30,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:30,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:30,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:30,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 635 transitions. [2022-04-27 15:32:30,912 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 635 transitions. Word has length 122 [2022-04-27 15:32:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:30,913 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 635 transitions. [2022-04-27 15:32:30,913 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-27 15:32:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 635 transitions. [2022-04-27 15:32:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:32:30,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:30,914 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:32:30,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:32:30,914 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 949148907, now seen corresponding path program 1 times [2022-04-27 15:32:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:30,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415627856] [2022-04-27 15:32:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:30,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:31,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {44896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44889#true} is VALID [2022-04-27 15:32:31,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {44889#true} assume true; {44889#true} is VALID [2022-04-27 15:32:31,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44889#true} {44889#true} #689#return; {44889#true} is VALID [2022-04-27 15:32:31,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {44889#true} call ULTIMATE.init(); {44896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:31,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {44896#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44889#true} is VALID [2022-04-27 15:32:31,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {44889#true} assume true; {44889#true} is VALID [2022-04-27 15:32:31,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44889#true} {44889#true} #689#return; {44889#true} is VALID [2022-04-27 15:32:31,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {44889#true} call #t~ret161 := main(); {44889#true} is VALID [2022-04-27 15:32:31,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {44889#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {44889#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L272 TraceCheckUtils]: 7: Hoare triple {44889#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {44889#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {44889#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {44889#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {44889#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {44889#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {44889#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {44889#true} assume !false; {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {44889#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {44889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {44889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {44889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {44889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {44889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {44889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {44889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {44889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {44889#true} assume 8464 == #t~mem55;havoc #t~mem55; {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {44889#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {44889#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {44889#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {44889#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {44889#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {44889#true} ~skip~0 := 0; {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {44889#true} assume !false; {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {44889#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {44889#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {44889#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {44889#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {44889#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {44889#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {44889#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {44889#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {44889#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {44889#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {44889#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 43: Hoare triple {44889#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {44889#true} assume 8496 == #t~mem58;havoc #t~mem58; {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 45: Hoare triple {44889#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {44889#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {44889#true} is VALID [2022-04-27 15:32:31,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {44889#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {44889#true} is VALID [2022-04-27 15:32:31,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {44889#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:31,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {44894#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44895#(= |ssl3_accept_#t~mem49| 8656)} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {44895#(= |ssl3_accept_#t~mem49| 8656)} assume 8192 == #t~mem49;havoc #t~mem49; {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {44890#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {44890#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {44890#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {44890#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {44890#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {44890#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {44890#false} assume 12292 != #t~mem85;havoc #t~mem85; {44890#false} is VALID [2022-04-27 15:32:31,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {44890#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 66: Hoare triple {44890#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 67: Hoare triple {44890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 68: Hoare triple {44890#false} ~skip~0 := 0; {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {44890#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {44890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {44890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {44890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {44890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {44890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {44890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {44890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {44890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {44890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {44890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {44890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {44890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {44890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {44890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 85: Hoare triple {44890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 86: Hoare triple {44890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 87: Hoare triple {44890#false} assume 8529 == #t~mem63;havoc #t~mem63; {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 88: Hoare triple {44890#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 89: Hoare triple {44890#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {44890#false} is VALID [2022-04-27 15:32:31,100 INFO L290 TraceCheckUtils]: 90: Hoare triple {44890#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 91: Hoare triple {44890#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 92: Hoare triple {44890#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 93: Hoare triple {44890#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 94: Hoare triple {44890#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 95: Hoare triple {44890#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 96: Hoare triple {44890#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 97: Hoare triple {44890#false} ~skip~0 := 0; {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 98: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 99: Hoare triple {44890#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 100: Hoare triple {44890#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 101: Hoare triple {44890#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,101 INFO L290 TraceCheckUtils]: 102: Hoare triple {44890#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 103: Hoare triple {44890#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 104: Hoare triple {44890#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 105: Hoare triple {44890#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {44890#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 107: Hoare triple {44890#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 108: Hoare triple {44890#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 109: Hoare triple {44890#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 110: Hoare triple {44890#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 111: Hoare triple {44890#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 112: Hoare triple {44890#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,102 INFO L290 TraceCheckUtils]: 113: Hoare triple {44890#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 114: Hoare triple {44890#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 115: Hoare triple {44890#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 116: Hoare triple {44890#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 117: Hoare triple {44890#false} assume 8544 == #t~mem64;havoc #t~mem64; {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 118: Hoare triple {44890#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 119: Hoare triple {44890#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 120: Hoare triple {44890#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 121: Hoare triple {44890#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 122: Hoare triple {44890#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 123: Hoare triple {44890#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 124: Hoare triple {44890#false} assume 8 == ~blastFlag~0; {44890#false} is VALID [2022-04-27 15:32:31,103 INFO L290 TraceCheckUtils]: 125: Hoare triple {44890#false} assume !false; {44890#false} is VALID [2022-04-27 15:32:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:32:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415627856] [2022-04-27 15:32:31,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415627856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:31,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:31,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372829343] [2022-04-27 15:32:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:32:31,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:31,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:31,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:31,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:31,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:31,188 INFO L87 Difference]: Start difference. First operand 420 states and 635 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:33,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:35,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:38,061 INFO L93 Difference]: Finished difference Result 862 states and 1307 transitions. [2022-04-27 15:32:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:32:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-27 15:32:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-27 15:32:38,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-27 15:32:38,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:38,415 INFO L225 Difference]: With dead ends: 862 [2022-04-27 15:32:38,415 INFO L226 Difference]: Without dead ends: 468 [2022-04-27 15:32:38,415 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-27 15:32:38,416 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 89 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:38,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 525 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-27 15:32:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-27 15:32:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 420. [2022-04-27 15:32:38,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:38,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,425 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,425 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:38,436 INFO L93 Difference]: Finished difference Result 468 states and 701 transitions. [2022-04-27 15:32:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2022-04-27 15:32:38,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:38,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:38,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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 468 states. [2022-04-27 15:32:38,437 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 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 468 states. [2022-04-27 15:32:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:38,448 INFO L93 Difference]: Finished difference Result 468 states and 701 transitions. [2022-04-27 15:32:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 701 transitions. [2022-04-27 15:32:38,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:38,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:38,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:38,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5180722891566265) internal successors, (630), 415 states have internal predecessors, (630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 634 transitions. [2022-04-27 15:32:38,459 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 634 transitions. Word has length 126 [2022-04-27 15:32:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:38,459 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 634 transitions. [2022-04-27 15:32:38,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 634 transitions. [2022-04-27 15:32:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-27 15:32:38,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:38,460 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:32:38,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:32:38,461 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1788182569, now seen corresponding path program 1 times [2022-04-27 15:32:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466206172] [2022-04-27 15:32:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:38,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {47272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47265#true} is VALID [2022-04-27 15:32:38,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {47265#true} assume true; {47265#true} is VALID [2022-04-27 15:32:38,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47265#true} {47265#true} #689#return; {47265#true} is VALID [2022-04-27 15:32:38,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {47265#true} call ULTIMATE.init(); {47272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:38,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {47272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {47265#true} assume true; {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47265#true} {47265#true} #689#return; {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {47265#true} call #t~ret161 := main(); {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {47265#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {47265#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {47265#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {47265#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {47265#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {47265#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {47265#true} is VALID [2022-04-27 15:32:38,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {47265#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {47265#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {47265#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {47265#true} assume !false; {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {47265#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {47265#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {47265#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {47265#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {47265#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {47265#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {47265#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {47265#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {47265#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {47265#true} assume 8464 == #t~mem55;havoc #t~mem55; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {47265#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {47265#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {47265#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {47265#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {47265#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {47265#true} ~skip~0 := 0; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {47265#true} assume !false; {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {47265#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 33: Hoare triple {47265#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,597 INFO L290 TraceCheckUtils]: 34: Hoare triple {47265#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {47265#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {47265#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {47265#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 38: Hoare triple {47265#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {47265#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {47265#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {47265#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {47265#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {47265#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {47265#true} assume 8496 == #t~mem58;havoc #t~mem58; {47265#true} is VALID [2022-04-27 15:32:38,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {47265#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {47265#true} is VALID [2022-04-27 15:32:38,599 INFO L290 TraceCheckUtils]: 46: Hoare triple {47265#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {47265#true} is VALID [2022-04-27 15:32:38,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {47265#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {47265#true} is VALID [2022-04-27 15:32:38,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {47265#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:32:38,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {47270#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47271#(= |ssl3_accept_#t~mem49| 8512)} is VALID [2022-04-27 15:32:38,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {47271#(= |ssl3_accept_#t~mem49| 8512)} assume 8192 == #t~mem49;havoc #t~mem49; {47266#false} is VALID [2022-04-27 15:32:38,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {47266#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {47266#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47266#false} is VALID [2022-04-27 15:32:38,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {47266#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {47266#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {47266#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {47266#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {47266#false} assume 12292 != #t~mem85;havoc #t~mem85; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {47266#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {47266#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {47266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {47266#false} ~skip~0 := 0; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {47266#false} assume !false; {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 70: Hoare triple {47266#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {47266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {47266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {47266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {47266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {47266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {47266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {47266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {47266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {47266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {47266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {47266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {47266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {47266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {47266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 85: Hoare triple {47266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {47266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 87: Hoare triple {47266#false} assume 8529 == #t~mem63;havoc #t~mem63; {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 88: Hoare triple {47266#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 89: Hoare triple {47266#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {47266#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 91: Hoare triple {47266#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {47266#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {47266#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 94: Hoare triple {47266#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {47266#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 96: Hoare triple {47266#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 97: Hoare triple {47266#false} ~skip~0 := 0; {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 98: Hoare triple {47266#false} assume !false; {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 99: Hoare triple {47266#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 100: Hoare triple {47266#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {47266#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {47266#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {47266#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 104: Hoare triple {47266#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 105: Hoare triple {47266#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 106: Hoare triple {47266#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,607 INFO L290 TraceCheckUtils]: 107: Hoare triple {47266#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 108: Hoare triple {47266#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 109: Hoare triple {47266#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 110: Hoare triple {47266#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 111: Hoare triple {47266#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 112: Hoare triple {47266#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 113: Hoare triple {47266#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 114: Hoare triple {47266#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 115: Hoare triple {47266#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 116: Hoare triple {47266#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 117: Hoare triple {47266#false} assume 8544 == #t~mem64;havoc #t~mem64; {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 118: Hoare triple {47266#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,608 INFO L290 TraceCheckUtils]: 119: Hoare triple {47266#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 120: Hoare triple {47266#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 121: Hoare triple {47266#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 122: Hoare triple {47266#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 123: Hoare triple {47266#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 124: Hoare triple {47266#false} assume 8 == ~blastFlag~0; {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L290 TraceCheckUtils]: 125: Hoare triple {47266#false} assume !false; {47266#false} is VALID [2022-04-27 15:32:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:32:38,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466206172] [2022-04-27 15:32:38,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466206172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:38,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:38,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:38,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690585788] [2022-04-27 15:32:38,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:32:38,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:38,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:38,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:38,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:38,684 INFO L87 Difference]: Start difference. First operand 420 states and 634 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:43,763 INFO L93 Difference]: Finished difference Result 836 states and 1268 transitions. [2022-04-27 15:32:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:43,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 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 126 [2022-04-27 15:32:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:32:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-27 15:32:43,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-27 15:32:44,072 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-27 15:32:44,079 INFO L225 Difference]: With dead ends: 836 [2022-04-27 15:32:44,079 INFO L226 Difference]: Without dead ends: 442 [2022-04-27 15:32:44,080 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-27 15:32:44,080 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 46 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:44,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 603 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 15:32:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-27 15:32:44,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 420. [2022-04-27 15:32:44,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:44,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,089 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,090 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:44,099 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:32:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:32:44,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:44,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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 442 states. [2022-04-27 15:32:44,101 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 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 442 states. [2022-04-27 15:32:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:44,111 INFO L93 Difference]: Finished difference Result 442 states and 663 transitions. [2022-04-27 15:32:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 663 transitions. [2022-04-27 15:32:44,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:44,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:44,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:44,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.5156626506024096) internal successors, (629), 415 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 633 transitions. [2022-04-27 15:32:44,120 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 633 transitions. Word has length 126 [2022-04-27 15:32:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:44,121 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 633 transitions. [2022-04-27 15:32:44,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 633 transitions. [2022-04-27 15:32:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-27 15:32:44,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:44,122 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:32:44,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:32:44,122 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:44,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 46620656, now seen corresponding path program 1 times [2022-04-27 15:32:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:44,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221941676] [2022-04-27 15:32:44,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:44,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:44,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {49565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49558#true} is VALID [2022-04-27 15:32:44,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {49558#true} assume true; {49558#true} is VALID [2022-04-27 15:32:44,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49558#true} {49558#true} #689#return; {49558#true} is VALID [2022-04-27 15:32:44,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {49558#true} call ULTIMATE.init(); {49565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:44,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {49565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {49558#true} is VALID [2022-04-27 15:32:44,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {49558#true} assume true; {49558#true} is VALID [2022-04-27 15:32:44,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49558#true} {49558#true} #689#return; {49558#true} is VALID [2022-04-27 15:32:44,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {49558#true} call #t~ret161 := main(); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {49558#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {49558#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L272 TraceCheckUtils]: 7: Hoare triple {49558#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {49558#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {49558#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {49558#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {49558#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {49558#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {49558#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {49558#true} assume !false; {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {49558#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {49558#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {49558#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {49558#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {49558#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {49558#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {49558#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {49558#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {49558#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {49558#true} assume 8464 == #t~mem55;havoc #t~mem55; {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {49558#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {49558#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {49558#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {49558#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {49558#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {49558#true} ~skip~0 := 0; {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {49558#true} assume !false; {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {49558#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {49558#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {49558#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {49558#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {49558#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {49558#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {49558#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {49558#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {49558#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,265 INFO L290 TraceCheckUtils]: 41: Hoare triple {49558#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {49558#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {49558#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {49558#true} assume 8496 == #t~mem58;havoc #t~mem58; {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {49558#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {49558#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {49558#true} is VALID [2022-04-27 15:32:44,266 INFO L290 TraceCheckUtils]: 47: Hoare triple {49558#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {49558#true} is VALID [2022-04-27 15:32:44,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {49558#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {49563#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49564#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {49564#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {49559#false} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {49559#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {49559#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {49559#false} is VALID [2022-04-27 15:32:44,271 INFO L290 TraceCheckUtils]: 62: Hoare triple {49559#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {49559#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {49559#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {49559#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 66: Hoare triple {49559#false} assume 12292 != #t~mem85;havoc #t~mem85; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 67: Hoare triple {49559#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {49559#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {49559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {49559#false} ~skip~0 := 0; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {49559#false} assume !false; {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 72: Hoare triple {49559#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 73: Hoare triple {49559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {49559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 75: Hoare triple {49559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 76: Hoare triple {49559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {49559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {49559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {49559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 80: Hoare triple {49559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {49559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {49559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 83: Hoare triple {49559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 84: Hoare triple {49559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {49559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 86: Hoare triple {49559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,273 INFO L290 TraceCheckUtils]: 87: Hoare triple {49559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {49559#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 89: Hoare triple {49559#false} assume 8529 == #t~mem63;havoc #t~mem63; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 90: Hoare triple {49559#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 91: Hoare triple {49559#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 92: Hoare triple {49559#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {49559#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 94: Hoare triple {49559#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 95: Hoare triple {49559#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 96: Hoare triple {49559#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 97: Hoare triple {49559#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 98: Hoare triple {49559#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 99: Hoare triple {49559#false} ~skip~0 := 0; {49559#false} is VALID [2022-04-27 15:32:44,274 INFO L290 TraceCheckUtils]: 100: Hoare triple {49559#false} assume !false; {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 101: Hoare triple {49559#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 102: Hoare triple {49559#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 103: Hoare triple {49559#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 104: Hoare triple {49559#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {49559#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {49559#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 107: Hoare triple {49559#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 108: Hoare triple {49559#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 109: Hoare triple {49559#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 110: Hoare triple {49559#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 111: Hoare triple {49559#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 112: Hoare triple {49559#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,275 INFO L290 TraceCheckUtils]: 113: Hoare triple {49559#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 114: Hoare triple {49559#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 115: Hoare triple {49559#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 116: Hoare triple {49559#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 117: Hoare triple {49559#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 118: Hoare triple {49559#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 119: Hoare triple {49559#false} assume 8544 == #t~mem64;havoc #t~mem64; {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 120: Hoare triple {49559#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 121: Hoare triple {49559#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 122: Hoare triple {49559#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 123: Hoare triple {49559#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 124: Hoare triple {49559#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {49559#false} is VALID [2022-04-27 15:32:44,276 INFO L290 TraceCheckUtils]: 125: Hoare triple {49559#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {49559#false} is VALID [2022-04-27 15:32:44,277 INFO L290 TraceCheckUtils]: 126: Hoare triple {49559#false} assume 8 == ~blastFlag~0; {49559#false} is VALID [2022-04-27 15:32:44,277 INFO L290 TraceCheckUtils]: 127: Hoare triple {49559#false} assume !false; {49559#false} is VALID [2022-04-27 15:32:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-27 15:32:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:44,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221941676] [2022-04-27 15:32:44,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221941676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:44,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:44,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954931127] [2022-04-27 15:32:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:44,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 128 [2022-04-27 15:32:44,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:44,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:44,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:32:44,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:44,357 INFO L87 Difference]: Start difference. First operand 420 states and 633 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:49,992 INFO L93 Difference]: Finished difference Result 891 states and 1345 transitions. [2022-04-27 15:32:49,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:49,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 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 128 [2022-04-27 15:32:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:32:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-04-27 15:32:49,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 587 transitions. [2022-04-27 15:32:50,393 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-27 15:32:50,403 INFO L225 Difference]: With dead ends: 891 [2022-04-27 15:32:50,403 INFO L226 Difference]: Without dead ends: 497 [2022-04-27 15:32:50,403 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-27 15:32:50,404 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 141 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:50,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 15:32:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-27 15:32:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 420. [2022-04-27 15:32:50,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:50,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:50,415 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:50,416 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:50,428 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-27 15:32:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-27 15:32:50,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:50,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:50,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:32:50,430 INFO L87 Difference]: Start difference. First operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 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 497 states. [2022-04-27 15:32:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:50,442 INFO L93 Difference]: Finished difference Result 497 states and 734 transitions. [2022-04-27 15:32:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2022-04-27 15:32:50,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:50,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:50,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:50,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 415 states have (on average 1.4963855421686747) internal successors, (621), 415 states have internal predecessors, (621), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2022-04-27 15:32:50,453 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 128 [2022-04-27 15:32:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:50,454 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2022-04-27 15:32:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2022-04-27 15:32:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-27 15:32:50,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:50,461 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-27 15:32:50,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-27 15:32:50,462 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -149695392, now seen corresponding path program 1 times [2022-04-27 15:32:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542332726] [2022-04-27 15:32:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:50,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {52038#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52031#true} is VALID [2022-04-27 15:32:50,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#true} assume true; {52031#true} is VALID [2022-04-27 15:32:50,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52031#true} {52031#true} #689#return; {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {52031#true} call ULTIMATE.init(); {52038#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:50,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {52038#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {52031#true} assume true; {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52031#true} {52031#true} #689#return; {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {52031#true} call #t~ret161 := main(); {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {52031#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {52031#true} is VALID [2022-04-27 15:32:50,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {52031#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L272 TraceCheckUtils]: 7: Hoare triple {52031#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {52031#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {52031#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {52031#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {52031#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {52031#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {52031#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {52031#true} assume !false; {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {52031#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {52031#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {52031#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {52031#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {52031#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {52031#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {52031#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {52031#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {52031#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {52031#true} assume 8464 == #t~mem55;havoc #t~mem55; {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {52031#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {52031#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {52031#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {52031#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {52031#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {52031#true} ~skip~0 := 0; {52031#true} is VALID [2022-04-27 15:32:50,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {52031#true} assume !false; {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {52031#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {52031#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {52031#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {52031#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {52031#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {52031#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {52031#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {52031#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {52031#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {52031#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {52031#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {52031#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {52031#true} assume 8496 == #t~mem58;havoc #t~mem58; {52031#true} is VALID [2022-04-27 15:32:50,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {52031#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {52031#true} is VALID [2022-04-27 15:32:50,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {52031#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {52031#true} is VALID [2022-04-27 15:32:50,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {52031#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {52031#true} is VALID [2022-04-27 15:32:50,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {52031#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,615 INFO L290 TraceCheckUtils]: 55: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,615 INFO L290 TraceCheckUtils]: 56: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,616 INFO L290 TraceCheckUtils]: 57: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,616 INFO L290 TraceCheckUtils]: 58: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,617 INFO L290 TraceCheckUtils]: 61: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,619 INFO L290 TraceCheckUtils]: 64: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,620 INFO L290 TraceCheckUtils]: 67: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,620 INFO L290 TraceCheckUtils]: 68: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,627 INFO L290 TraceCheckUtils]: 83: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,627 INFO L290 TraceCheckUtils]: 84: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:32:50,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {52036#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {52037#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-27 15:32:50,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {52037#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {52032#false} is VALID [2022-04-27 15:32:50,628 INFO L290 TraceCheckUtils]: 88: Hoare triple {52032#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {52032#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 90: Hoare triple {52032#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 91: Hoare triple {52032#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 92: Hoare triple {52032#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 93: Hoare triple {52032#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 94: Hoare triple {52032#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 95: Hoare triple {52032#false} ~skip~0 := 0; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {52032#false} assume !false; {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {52032#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {52032#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {52032#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,629 INFO L290 TraceCheckUtils]: 100: Hoare triple {52032#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {52032#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 102: Hoare triple {52032#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {52032#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 104: Hoare triple {52032#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 105: Hoare triple {52032#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 106: Hoare triple {52032#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 107: Hoare triple {52032#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 108: Hoare triple {52032#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 109: Hoare triple {52032#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 110: Hoare triple {52032#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 111: Hoare triple {52032#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 112: Hoare triple {52032#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,630 INFO L290 TraceCheckUtils]: 113: Hoare triple {52032#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 114: Hoare triple {52032#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 115: Hoare triple {52032#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 116: Hoare triple {52032#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 117: Hoare triple {52032#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 118: Hoare triple {52032#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 119: Hoare triple {52032#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 120: Hoare triple {52032#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 121: Hoare triple {52032#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 122: Hoare triple {52032#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 123: Hoare triple {52032#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {52032#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,631 INFO L290 TraceCheckUtils]: 125: Hoare triple {52032#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52032#false} is VALID [2022-04-27 15:32:50,632 INFO L290 TraceCheckUtils]: 126: Hoare triple {52032#false} assume 8640 == #t~mem75;havoc #t~mem75; {52032#false} is VALID [2022-04-27 15:32:50,632 INFO L290 TraceCheckUtils]: 127: Hoare triple {52032#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52032#false} is VALID [2022-04-27 15:32:50,632 INFO L290 TraceCheckUtils]: 128: Hoare triple {52032#false} assume 4 == ~blastFlag~0; {52032#false} is VALID [2022-04-27 15:32:50,632 INFO L290 TraceCheckUtils]: 129: Hoare triple {52032#false} assume !false; {52032#false} is VALID [2022-04-27 15:32:50,632 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-27 15:32:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:50,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542332726] [2022-04-27 15:32:50,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542332726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:50,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:50,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:50,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267030475] [2022-04-27 15:32:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:50,644 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-27 15:32:50,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:50,645 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-27 15:32:50,743 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-27 15:32:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:50,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:50,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:50,744 INFO L87 Difference]: Start difference. First operand 420 states and 625 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-27 15:32:52,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:32:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:55,440 INFO L93 Difference]: Finished difference Result 931 states and 1390 transitions. [2022-04-27 15:32:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:32:55,440 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-27 15:32:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:32:55,440 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-27 15:32:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:32:55,443 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-27 15:32:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:32:55,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-27 15:32:55,842 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-27 15:32:55,852 INFO L225 Difference]: With dead ends: 931 [2022-04-27 15:32:55,852 INFO L226 Difference]: Without dead ends: 537 [2022-04-27 15:32:55,852 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-27 15:32:55,853 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:32:55,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 347 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:32:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-04-27 15:32:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 463. [2022-04-27 15:32:55,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:32:55,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:55,863 INFO L74 IsIncluded]: Start isIncluded. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:55,863 INFO L87 Difference]: Start difference. First operand 537 states. Second operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:55,876 INFO L93 Difference]: Finished difference Result 537 states and 794 transitions. [2022-04-27 15:32:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2022-04-27 15:32:55,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:55,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:55,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 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 537 states. [2022-04-27 15:32:55,879 INFO L87 Difference]: Start difference. First operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 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 537 states. [2022-04-27 15:32:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:32:55,892 INFO L93 Difference]: Finished difference Result 537 states and 794 transitions. [2022-04-27 15:32:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 794 transitions. [2022-04-27 15:32:55,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:32:55,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:32:55,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:32:55,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:32:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 458 states have (on average 1.5) internal successors, (687), 458 states have internal predecessors, (687), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:32:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 691 transitions. [2022-04-27 15:32:55,905 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 691 transitions. Word has length 130 [2022-04-27 15:32:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:32:55,905 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 691 transitions. [2022-04-27 15:32:55,905 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-27 15:32:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 691 transitions. [2022-04-27 15:32:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:32:55,906 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:32:55,907 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-27 15:32:55,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-27 15:32:55,907 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:32:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:32:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 1 times [2022-04-27 15:32:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:32:55,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284099769] [2022-04-27 15:32:55,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:32:55,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:32:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:32:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:32:56,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {54678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54671#true} is VALID [2022-04-27 15:32:56,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {54671#true} assume true; {54671#true} is VALID [2022-04-27 15:32:56,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54671#true} {54671#true} #689#return; {54671#true} is VALID [2022-04-27 15:32:56,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {54671#true} call ULTIMATE.init(); {54678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:32:56,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {54678#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {54671#true} is VALID [2022-04-27 15:32:56,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {54671#true} assume true; {54671#true} is VALID [2022-04-27 15:32:56,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54671#true} {54671#true} #689#return; {54671#true} is VALID [2022-04-27 15:32:56,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {54671#true} call #t~ret161 := main(); {54671#true} is VALID [2022-04-27 15:32:56,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {54671#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {54671#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L272 TraceCheckUtils]: 7: Hoare triple {54671#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {54671#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {54671#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {54671#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {54671#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {54671#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {54671#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {54671#true} assume !false; {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {54671#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {54671#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {54671#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {54671#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {54671#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {54671#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {54671#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {54671#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {54671#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {54671#true} assume 8464 == #t~mem55;havoc #t~mem55; {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {54671#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {54671#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {54671#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {54671#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {54671#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54671#true} is VALID [2022-04-27 15:32:56,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {54671#true} ~skip~0 := 0; {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {54671#true} assume !false; {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {54671#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {54671#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {54671#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {54671#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {54671#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {54671#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {54671#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {54671#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {54671#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {54671#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {54671#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {54671#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {54671#true} assume 8496 == #t~mem58;havoc #t~mem58; {54671#true} is VALID [2022-04-27 15:32:56,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {54671#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {54671#true} is VALID [2022-04-27 15:32:56,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {54671#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54671#true} is VALID [2022-04-27 15:32:56,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {54671#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {54671#true} is VALID [2022-04-27 15:32:56,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {54671#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,062 INFO L290 TraceCheckUtils]: 62: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:32:56,064 INFO L290 TraceCheckUtils]: 67: Hoare triple {54676#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54677#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-27 15:32:56,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {54677#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {54672#false} is VALID [2022-04-27 15:32:56,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {54672#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {54672#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {54672#false} is VALID [2022-04-27 15:32:56,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {54672#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {54672#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 73: Hoare triple {54672#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 74: Hoare triple {54672#false} ~skip~0 := 0; {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 75: Hoare triple {54672#false} assume !false; {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 76: Hoare triple {54672#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 77: Hoare triple {54672#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 78: Hoare triple {54672#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 79: Hoare triple {54672#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {54672#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {54672#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 82: Hoare triple {54672#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {54672#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {54672#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 85: Hoare triple {54672#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 86: Hoare triple {54672#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 87: Hoare triple {54672#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 88: Hoare triple {54672#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 89: Hoare triple {54672#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 90: Hoare triple {54672#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 91: Hoare triple {54672#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {54672#false} assume 8528 == #t~mem62;havoc #t~mem62; {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 93: Hoare triple {54672#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 94: Hoare triple {54672#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 95: Hoare triple {54672#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {54672#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 97: Hoare triple {54672#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 98: Hoare triple {54672#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 99: Hoare triple {54672#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 100: Hoare triple {54672#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 101: Hoare triple {54672#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 102: Hoare triple {54672#false} ~skip~0 := 0; {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 103: Hoare triple {54672#false} assume !false; {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {54672#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 105: Hoare triple {54672#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 106: Hoare triple {54672#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 107: Hoare triple {54672#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,068 INFO L290 TraceCheckUtils]: 108: Hoare triple {54672#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 109: Hoare triple {54672#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 110: Hoare triple {54672#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 111: Hoare triple {54672#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 112: Hoare triple {54672#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 113: Hoare triple {54672#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 114: Hoare triple {54672#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 115: Hoare triple {54672#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 116: Hoare triple {54672#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 117: Hoare triple {54672#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 118: Hoare triple {54672#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,069 INFO L290 TraceCheckUtils]: 119: Hoare triple {54672#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 120: Hoare triple {54672#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 121: Hoare triple {54672#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 122: Hoare triple {54672#false} assume 8544 == #t~mem64;havoc #t~mem64; {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 123: Hoare triple {54672#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 124: Hoare triple {54672#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 125: Hoare triple {54672#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 126: Hoare triple {54672#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 127: Hoare triple {54672#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 128: Hoare triple {54672#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 129: Hoare triple {54672#false} assume 8 == ~blastFlag~0; {54672#false} is VALID [2022-04-27 15:32:56,070 INFO L290 TraceCheckUtils]: 130: Hoare triple {54672#false} assume !false; {54672#false} is VALID [2022-04-27 15:32:56,071 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-27 15:32:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:32:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284099769] [2022-04-27 15:32:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284099769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:32:56,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:32:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:32:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577528476] [2022-04-27 15:32:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:32:56,072 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-27 15:32:56,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:32:56,073 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-27 15:32:56,158 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-27 15:32:56,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:32:56,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:32:56,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:32:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:32:56,159 INFO L87 Difference]: Start difference. First operand 463 states and 691 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-27 15:33:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:01,346 INFO L93 Difference]: Finished difference Result 938 states and 1405 transitions. [2022-04-27 15:33:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:33:01,346 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-27 15:33:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:01,346 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-27 15:33:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-27 15:33:01,349 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-27 15:33:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-27 15:33:01,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-27 15:33:01,682 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-27 15:33:01,691 INFO L225 Difference]: With dead ends: 938 [2022-04-27 15:33:01,692 INFO L226 Difference]: Without dead ends: 501 [2022-04-27 15:33:01,692 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-27 15:33:01,693 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 68 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:01,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 529 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-27 15:33:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-27 15:33:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 463. [2022-04-27 15:33:01,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:01,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:01,702 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:01,703 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:01,714 INFO L93 Difference]: Finished difference Result 501 states and 743 transitions. [2022-04-27 15:33:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 743 transitions. [2022-04-27 15:33:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:01,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:01,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 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 501 states. [2022-04-27 15:33:01,716 INFO L87 Difference]: Start difference. First operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 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 501 states. [2022-04-27 15:33:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:01,728 INFO L93 Difference]: Finished difference Result 501 states and 743 transitions. [2022-04-27 15:33:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 743 transitions. [2022-04-27 15:33:01,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:01,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:01,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:01,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 458 states have (on average 1.497816593886463) internal successors, (686), 458 states have internal predecessors, (686), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 690 transitions. [2022-04-27 15:33:01,740 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 690 transitions. Word has length 131 [2022-04-27 15:33:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:01,741 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 690 transitions. [2022-04-27 15:33:01,741 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-27 15:33:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 690 transitions. [2022-04-27 15:33:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:33:01,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:01,742 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-27 15:33:01,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-27 15:33:01,742 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 913993068, now seen corresponding path program 1 times [2022-04-27 15:33:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:01,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754982997] [2022-04-27 15:33:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:01,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:01,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {57244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57237#true} is VALID [2022-04-27 15:33:01,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {57237#true} assume true; {57237#true} is VALID [2022-04-27 15:33:01,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57237#true} {57237#true} #689#return; {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {57237#true} call ULTIMATE.init(); {57244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:01,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {57244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {57237#true} assume true; {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57237#true} {57237#true} #689#return; {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {57237#true} call #t~ret161 := main(); {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {57237#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {57237#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L272 TraceCheckUtils]: 7: Hoare triple {57237#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {57237#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {57237#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {57237#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {57237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {57237#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {57237#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {57237#true} assume !false; {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {57237#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {57237#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {57237#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {57237#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {57237#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {57237#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {57237#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {57237#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {57237#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {57237#true} assume 8464 == #t~mem55;havoc #t~mem55; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {57237#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {57237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {57237#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {57237#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {57237#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {57237#true} ~skip~0 := 0; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {57237#true} assume !false; {57237#true} is VALID [2022-04-27 15:33:01,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {57237#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {57237#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 34: Hoare triple {57237#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {57237#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {57237#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {57237#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {57237#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {57237#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {57237#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {57237#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {57237#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {57237#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {57237#true} assume 8496 == #t~mem58;havoc #t~mem58; {57237#true} is VALID [2022-04-27 15:33:01,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {57237#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {57237#true} is VALID [2022-04-27 15:33:01,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {57237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {57237#true} is VALID [2022-04-27 15:33:01,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {57237#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {57237#true} is VALID [2022-04-27 15:33:01,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {57237#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,912 INFO L290 TraceCheckUtils]: 63: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,914 INFO L290 TraceCheckUtils]: 68: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,914 INFO L290 TraceCheckUtils]: 69: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,915 INFO L290 TraceCheckUtils]: 71: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,915 INFO L290 TraceCheckUtils]: 72: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,916 INFO L290 TraceCheckUtils]: 73: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,916 INFO L290 TraceCheckUtils]: 74: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,916 INFO L290 TraceCheckUtils]: 75: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,917 INFO L290 TraceCheckUtils]: 76: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,917 INFO L290 TraceCheckUtils]: 77: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,918 INFO L290 TraceCheckUtils]: 78: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,918 INFO L290 TraceCheckUtils]: 79: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,918 INFO L290 TraceCheckUtils]: 80: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,919 INFO L290 TraceCheckUtils]: 81: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,919 INFO L290 TraceCheckUtils]: 82: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,919 INFO L290 TraceCheckUtils]: 83: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,920 INFO L290 TraceCheckUtils]: 84: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,920 INFO L290 TraceCheckUtils]: 85: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,921 INFO L290 TraceCheckUtils]: 86: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:01,921 INFO L290 TraceCheckUtils]: 87: Hoare triple {57242#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {57243#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-27 15:33:01,921 INFO L290 TraceCheckUtils]: 88: Hoare triple {57243#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {57238#false} is VALID [2022-04-27 15:33:01,921 INFO L290 TraceCheckUtils]: 89: Hoare triple {57238#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 90: Hoare triple {57238#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 91: Hoare triple {57238#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 92: Hoare triple {57238#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 93: Hoare triple {57238#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 94: Hoare triple {57238#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 95: Hoare triple {57238#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 96: Hoare triple {57238#false} ~skip~0 := 0; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 97: Hoare triple {57238#false} assume !false; {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 98: Hoare triple {57238#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {57238#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 100: Hoare triple {57238#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 101: Hoare triple {57238#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,922 INFO L290 TraceCheckUtils]: 102: Hoare triple {57238#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 103: Hoare triple {57238#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 104: Hoare triple {57238#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 105: Hoare triple {57238#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 106: Hoare triple {57238#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 107: Hoare triple {57238#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 108: Hoare triple {57238#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 109: Hoare triple {57238#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {57238#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 111: Hoare triple {57238#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {57238#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 113: Hoare triple {57238#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 114: Hoare triple {57238#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 115: Hoare triple {57238#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,923 INFO L290 TraceCheckUtils]: 116: Hoare triple {57238#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 117: Hoare triple {57238#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 118: Hoare triple {57238#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 119: Hoare triple {57238#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 120: Hoare triple {57238#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 121: Hoare triple {57238#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 122: Hoare triple {57238#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 123: Hoare triple {57238#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 124: Hoare triple {57238#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 125: Hoare triple {57238#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 126: Hoare triple {57238#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 127: Hoare triple {57238#false} assume 8640 == #t~mem75;havoc #t~mem75; {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 128: Hoare triple {57238#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {57238#false} is VALID [2022-04-27 15:33:01,924 INFO L290 TraceCheckUtils]: 129: Hoare triple {57238#false} assume 4 == ~blastFlag~0; {57238#false} is VALID [2022-04-27 15:33:01,925 INFO L290 TraceCheckUtils]: 130: Hoare triple {57238#false} assume !false; {57238#false} is VALID [2022-04-27 15:33:01,925 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-27 15:33:01,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754982997] [2022-04-27 15:33:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754982997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:01,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:01,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:33:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754938446] [2022-04-27 15:33:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:01,926 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-27 15:33:01,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:01,927 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-27 15:33:02,023 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-27 15:33:02,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:33:02,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:33:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:33:02,025 INFO L87 Difference]: Start difference. First operand 463 states and 690 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-27 15:33:05,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:33:08,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:33:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:11,579 INFO L93 Difference]: Finished difference Result 977 states and 1459 transitions. [2022-04-27 15:33:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:33:11,579 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-27 15:33:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:11,580 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-27 15:33:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:33:11,582 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-27 15:33:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2022-04-27 15:33:11,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 586 transitions. [2022-04-27 15:33:11,975 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-27 15:33:11,989 INFO L225 Difference]: With dead ends: 977 [2022-04-27 15:33:11,989 INFO L226 Difference]: Without dead ends: 538 [2022-04-27 15:33:11,990 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-27 15:33:11,990 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 112 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:11,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 360 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-27 15:33:11,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-27 15:33:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 465. [2022-04-27 15:33:11,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:11,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:11,999 INFO L74 IsIncluded]: Start isIncluded. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:12,000 INFO L87 Difference]: Start difference. First operand 538 states. Second operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:12,013 INFO L93 Difference]: Finished difference Result 538 states and 795 transitions. [2022-04-27 15:33:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 795 transitions. [2022-04-27 15:33:12,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:12,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:12,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 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 538 states. [2022-04-27 15:33:12,014 INFO L87 Difference]: Start difference. First operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 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 538 states. [2022-04-27 15:33:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:12,025 INFO L93 Difference]: Finished difference Result 538 states and 795 transitions. [2022-04-27 15:33:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 795 transitions. [2022-04-27 15:33:12,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:12,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:12,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:12,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 460 states have (on average 1.4978260869565216) internal successors, (689), 460 states have internal predecessors, (689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 693 transitions. [2022-04-27 15:33:12,035 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 693 transitions. Word has length 131 [2022-04-27 15:33:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:12,035 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 693 transitions. [2022-04-27 15:33:12,035 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-27 15:33:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 693 transitions. [2022-04-27 15:33:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:33:12,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:12,036 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-27 15:33:12,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-27 15:33:12,036 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:12,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 1 times [2022-04-27 15:33:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:12,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968760809] [2022-04-27 15:33:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:12,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {59935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59929#true} is VALID [2022-04-27 15:33:12,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {59929#true} assume true; {59929#true} is VALID [2022-04-27 15:33:12,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59929#true} {59929#true} #689#return; {59929#true} is VALID [2022-04-27 15:33:12,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {59929#true} call ULTIMATE.init(); {59935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {59935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59929#true} is VALID [2022-04-27 15:33:12,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {59929#true} assume true; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59929#true} {59929#true} #689#return; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {59929#true} call #t~ret161 := main(); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {59929#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {59929#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L272 TraceCheckUtils]: 7: Hoare triple {59929#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {59929#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {59929#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {59929#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {59929#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {59929#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {59929#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {59929#true} assume !false; {59929#true} is VALID [2022-04-27 15:33:12,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {59929#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {59929#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {59929#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {59929#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {59929#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {59929#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {59929#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {59929#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {59929#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {59929#true} assume 8464 == #t~mem55;havoc #t~mem55; {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {59929#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {59929#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {59929#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {59929#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {59929#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {59929#true} ~skip~0 := 0; {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {59929#true} assume !false; {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {59929#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {59929#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {59929#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {59929#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {59929#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {59929#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {59929#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {59929#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {59929#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {59929#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {59929#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {59929#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59929#true} is VALID [2022-04-27 15:33:12,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {59929#true} assume 8496 == #t~mem58;havoc #t~mem58; {59929#true} is VALID [2022-04-27 15:33:12,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {59929#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {59929#true} is VALID [2022-04-27 15:33:12,195 INFO L290 TraceCheckUtils]: 46: Hoare triple {59929#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,195 INFO L290 TraceCheckUtils]: 47: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,201 INFO L290 TraceCheckUtils]: 65: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,202 INFO L290 TraceCheckUtils]: 69: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {59934#(= 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))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,203 INFO L290 TraceCheckUtils]: 72: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,212 INFO L290 TraceCheckUtils]: 74: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,212 INFO L290 TraceCheckUtils]: 75: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,212 INFO L290 TraceCheckUtils]: 76: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,213 INFO L290 TraceCheckUtils]: 77: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,213 INFO L290 TraceCheckUtils]: 78: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,213 INFO L290 TraceCheckUtils]: 79: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,213 INFO L290 TraceCheckUtils]: 80: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,214 INFO L290 TraceCheckUtils]: 81: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,214 INFO L290 TraceCheckUtils]: 82: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,214 INFO L290 TraceCheckUtils]: 83: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,215 INFO L290 TraceCheckUtils]: 84: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,215 INFO L290 TraceCheckUtils]: 85: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,216 INFO L290 TraceCheckUtils]: 87: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,216 INFO L290 TraceCheckUtils]: 88: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,216 INFO L290 TraceCheckUtils]: 89: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,216 INFO L290 TraceCheckUtils]: 90: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,217 INFO L290 TraceCheckUtils]: 91: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,217 INFO L290 TraceCheckUtils]: 92: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,217 INFO L290 TraceCheckUtils]: 93: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,218 INFO L290 TraceCheckUtils]: 94: Hoare triple {59934#(= 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))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,218 INFO L290 TraceCheckUtils]: 95: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,218 INFO L290 TraceCheckUtils]: 96: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,219 INFO L290 TraceCheckUtils]: 97: Hoare triple {59934#(= 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))) % 4294967296); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,219 INFO L290 TraceCheckUtils]: 98: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,219 INFO L290 TraceCheckUtils]: 99: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,219 INFO L290 TraceCheckUtils]: 100: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,220 INFO L290 TraceCheckUtils]: 101: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,220 INFO L290 TraceCheckUtils]: 102: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,220 INFO L290 TraceCheckUtils]: 103: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,221 INFO L290 TraceCheckUtils]: 104: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,221 INFO L290 TraceCheckUtils]: 105: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,221 INFO L290 TraceCheckUtils]: 106: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,222 INFO L290 TraceCheckUtils]: 107: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,222 INFO L290 TraceCheckUtils]: 108: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,222 INFO L290 TraceCheckUtils]: 109: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,222 INFO L290 TraceCheckUtils]: 110: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,223 INFO L290 TraceCheckUtils]: 111: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,223 INFO L290 TraceCheckUtils]: 112: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,223 INFO L290 TraceCheckUtils]: 113: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,224 INFO L290 TraceCheckUtils]: 114: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,224 INFO L290 TraceCheckUtils]: 115: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,224 INFO L290 TraceCheckUtils]: 116: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,225 INFO L290 TraceCheckUtils]: 117: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,225 INFO L290 TraceCheckUtils]: 118: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,225 INFO L290 TraceCheckUtils]: 119: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,225 INFO L290 TraceCheckUtils]: 120: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,226 INFO L290 TraceCheckUtils]: 121: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,249 INFO L290 TraceCheckUtils]: 122: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,250 INFO L290 TraceCheckUtils]: 123: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,250 INFO L290 TraceCheckUtils]: 124: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,250 INFO L290 TraceCheckUtils]: 125: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,251 INFO L290 TraceCheckUtils]: 126: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,251 INFO L290 TraceCheckUtils]: 127: Hoare triple {59934#(= 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))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,251 INFO L290 TraceCheckUtils]: 128: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {59934#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:33:12,252 INFO L290 TraceCheckUtils]: 129: Hoare triple {59934#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {59930#false} is VALID [2022-04-27 15:33:12,252 INFO L290 TraceCheckUtils]: 130: Hoare triple {59930#false} assume !false; {59930#false} is VALID [2022-04-27 15:33:12,252 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-27 15:33:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:12,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968760809] [2022-04-27 15:33:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968760809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:12,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:12,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:33:12,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827344605] [2022-04-27 15:33:12,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:12,253 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-27 15:33:12,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:12,254 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-27 15:33:12,327 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-27 15:33:12,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:33:12,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:12,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:33:12,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:33:12,328 INFO L87 Difference]: Start difference. First operand 465 states and 693 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-27 15:33:15,588 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-27 15:33:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:16,322 INFO L93 Difference]: Finished difference Result 1295 states and 1949 transitions. [2022-04-27 15:33:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:33:16,323 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-27 15:33:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:16,323 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-27 15:33:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-27 15:33:16,325 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-27 15:33:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-27 15:33:16,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-27 15:33:16,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:33:16,733 INFO L225 Difference]: With dead ends: 1295 [2022-04-27 15:33:16,733 INFO L226 Difference]: Without dead ends: 856 [2022-04-27 15:33:16,734 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-27 15:33:16,735 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:16,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 441 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-27 15:33:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-04-27 15:33:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2022-04-27 15:33:16,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:16,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:16,766 INFO L74 IsIncluded]: Start isIncluded. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:16,766 INFO L87 Difference]: Start difference. First operand 856 states. Second operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:16,797 INFO L93 Difference]: Finished difference Result 856 states and 1276 transitions. [2022-04-27 15:33:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-27 15:33:16,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:16,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:16,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 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 856 states. [2022-04-27 15:33:16,800 INFO L87 Difference]: Start difference. First operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 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 856 states. [2022-04-27 15:33:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:16,833 INFO L93 Difference]: Finished difference Result 856 states and 1276 transitions. [2022-04-27 15:33:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-27 15:33:16,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:16,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:16,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:16,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 851 states have (on average 1.4947121034077555) internal successors, (1272), 851 states have internal predecessors, (1272), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1276 transitions. [2022-04-27 15:33:16,870 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1276 transitions. Word has length 131 [2022-04-27 15:33:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:16,870 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1276 transitions. [2022-04-27 15:33:16,870 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-27 15:33:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1276 transitions. [2022-04-27 15:33:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:33:16,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:16,872 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-27 15:33:16,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-27 15:33:16,872 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:16,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 1 times [2022-04-27 15:33:16,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:16,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188878984] [2022-04-27 15:33:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:16,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {64030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {64024#true} is VALID [2022-04-27 15:33:16,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {64024#true} assume true; {64024#true} is VALID [2022-04-27 15:33:16,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64024#true} {64024#true} #689#return; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {64024#true} call ULTIMATE.init(); {64030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:16,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {64030#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {64024#true} assume true; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64024#true} {64024#true} #689#return; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {64024#true} call #t~ret161 := main(); {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {64024#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {64024#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L272 TraceCheckUtils]: 7: Hoare triple {64024#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {64024#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {64024#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {64024#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {64024#true} is VALID [2022-04-27 15:33:16,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {64024#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {64024#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {64024#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {64024#true} assume !false; {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {64024#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {64024#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {64024#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {64024#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {64024#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {64024#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {64024#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {64024#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {64024#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64024#true} is VALID [2022-04-27 15:33:16,994 INFO L290 TraceCheckUtils]: 24: Hoare triple {64024#true} assume 8464 == #t~mem55;havoc #t~mem55; {64024#true} is VALID [2022-04-27 15:33:16,994 INFO L290 TraceCheckUtils]: 25: Hoare triple {64024#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {64024#true} is VALID [2022-04-27 15:33:16,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {64024#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !false; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:16,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:17,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:17,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:17,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {64029#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {64029#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 47: Hoare triple {64025#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {64025#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {64025#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {64025#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {64025#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {64025#false} ~skip~0 := 0; {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {64025#false} assume !false; {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {64025#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {64025#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 56: Hoare triple {64025#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 57: Hoare triple {64025#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 58: Hoare triple {64025#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {64025#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {64025#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {64025#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 62: Hoare triple {64025#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 63: Hoare triple {64025#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 64: Hoare triple {64025#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 65: Hoare triple {64025#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,002 INFO L290 TraceCheckUtils]: 66: Hoare triple {64025#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 67: Hoare triple {64025#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 68: Hoare triple {64025#false} assume 8512 == #t~mem60;havoc #t~mem60; {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 69: Hoare triple {64025#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 70: Hoare triple {64025#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 71: Hoare triple {64025#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 72: Hoare triple {64025#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 73: Hoare triple {64025#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 74: Hoare triple {64025#false} ~skip~0 := 0; {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 75: Hoare triple {64025#false} assume !false; {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 76: Hoare triple {64025#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 77: Hoare triple {64025#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {64025#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 79: Hoare triple {64025#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 80: Hoare triple {64025#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 81: Hoare triple {64025#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 82: Hoare triple {64025#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {64025#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {64025#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 85: Hoare triple {64025#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 86: Hoare triple {64025#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 87: Hoare triple {64025#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {64025#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {64025#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,004 INFO L290 TraceCheckUtils]: 90: Hoare triple {64025#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 91: Hoare triple {64025#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {64025#false} assume 8528 == #t~mem62;havoc #t~mem62; {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 93: Hoare triple {64025#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 94: Hoare triple {64025#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 95: Hoare triple {64025#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 96: Hoare triple {64025#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 97: Hoare triple {64025#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 98: Hoare triple {64025#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 99: Hoare triple {64025#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 100: Hoare triple {64025#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 101: Hoare triple {64025#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64025#false} is VALID [2022-04-27 15:33:17,005 INFO L290 TraceCheckUtils]: 102: Hoare triple {64025#false} ~skip~0 := 0; {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 103: Hoare triple {64025#false} assume !false; {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 104: Hoare triple {64025#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 105: Hoare triple {64025#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 106: Hoare triple {64025#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 107: Hoare triple {64025#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 108: Hoare triple {64025#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 109: Hoare triple {64025#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 110: Hoare triple {64025#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 111: Hoare triple {64025#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 112: Hoare triple {64025#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 113: Hoare triple {64025#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 114: Hoare triple {64025#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,006 INFO L290 TraceCheckUtils]: 115: Hoare triple {64025#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 116: Hoare triple {64025#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 117: Hoare triple {64025#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 118: Hoare triple {64025#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 119: Hoare triple {64025#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 120: Hoare triple {64025#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 121: Hoare triple {64025#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 122: Hoare triple {64025#false} assume 8544 == #t~mem64;havoc #t~mem64; {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 123: Hoare triple {64025#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 124: Hoare triple {64025#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 125: Hoare triple {64025#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {64025#false} is VALID [2022-04-27 15:33:17,007 INFO L290 TraceCheckUtils]: 126: Hoare triple {64025#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {64025#false} is VALID [2022-04-27 15:33:17,008 INFO L290 TraceCheckUtils]: 127: Hoare triple {64025#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {64025#false} is VALID [2022-04-27 15:33:17,008 INFO L290 TraceCheckUtils]: 128: Hoare triple {64025#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {64025#false} is VALID [2022-04-27 15:33:17,008 INFO L290 TraceCheckUtils]: 129: Hoare triple {64025#false} assume 8 == ~blastFlag~0; {64025#false} is VALID [2022-04-27 15:33:17,008 INFO L290 TraceCheckUtils]: 130: Hoare triple {64025#false} assume !false; {64025#false} is VALID [2022-04-27 15:33:17,008 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-27 15:33:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:17,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188878984] [2022-04-27 15:33:17,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188878984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:17,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:17,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:33:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926794678] [2022-04-27 15:33:17,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:17,009 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-27 15:33:17,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:17,010 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-27 15:33:17,084 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-27 15:33:17,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:33:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:17,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:33:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:33:17,085 INFO L87 Difference]: Start difference. First operand 856 states and 1276 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-27 15:33:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:20,234 INFO L93 Difference]: Finished difference Result 1713 states and 2559 transitions. [2022-04-27 15:33:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:33:20,234 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-27 15:33:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:20,234 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-27 15:33:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:33:20,237 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-27 15:33:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-27 15:33:20,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-27 15:33:20,525 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-27 15:33:20,551 INFO L225 Difference]: With dead ends: 1713 [2022-04-27 15:33:20,551 INFO L226 Difference]: Without dead ends: 883 [2022-04-27 15:33:20,552 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-27 15:33:20,552 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:20,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-27 15:33:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-04-27 15:33:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-04-27 15:33:20,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:20,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:20,568 INFO L74 IsIncluded]: Start isIncluded. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:20,569 INFO L87 Difference]: Start difference. First operand 883 states. Second operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:20,602 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-27 15:33:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:33:20,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:20,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:20,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 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 883 states. [2022-04-27 15:33:20,605 INFO L87 Difference]: Start difference. First operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 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 883 states. [2022-04-27 15:33:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:20,635 INFO L93 Difference]: Finished difference Result 883 states and 1311 transitions. [2022-04-27 15:33:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:33:20,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:20,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:20,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:20,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 878 states have (on average 1.4886104783599088) internal successors, (1307), 878 states have internal predecessors, (1307), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2022-04-27 15:33:20,660 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 131 [2022-04-27 15:33:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:20,660 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2022-04-27 15:33:20,660 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-27 15:33:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2022-04-27 15:33:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-27 15:33:20,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:20,661 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-27 15:33:20,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-27 15:33:20,661 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 1 times [2022-04-27 15:33:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:20,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032365151] [2022-04-27 15:33:20,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:20,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {68672#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {68666#true} is VALID [2022-04-27 15:33:20,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {68666#true} assume true; {68666#true} is VALID [2022-04-27 15:33:20,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68666#true} {68666#true} #689#return; {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {68666#true} call ULTIMATE.init(); {68672#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:20,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {68672#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {68666#true} assume true; {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68666#true} {68666#true} #689#return; {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {68666#true} call #t~ret161 := main(); {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {68666#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {68666#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {68666#true} is VALID [2022-04-27 15:33:20,771 INFO L272 TraceCheckUtils]: 7: Hoare triple {68666#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {68666#true} is VALID [2022-04-27 15:33:20,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {68666#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {68671#(= 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)))); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !false; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {68671#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {68671#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {68667#false} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {68667#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {68667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {68667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68667#false} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {68667#false} ~skip~0 := 0; {68667#false} is VALID [2022-04-27 15:33:20,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {68667#false} assume !false; {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {68667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 33: Hoare triple {68667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {68667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {68667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {68667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {68667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {68667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {68667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {68667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {68667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {68667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,778 INFO L290 TraceCheckUtils]: 43: Hoare triple {68667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {68667#false} assume 8496 == #t~mem58;havoc #t~mem58; {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 45: Hoare triple {68667#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 46: Hoare triple {68667#false} assume !(1 == ~blastFlag~0); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 47: Hoare triple {68667#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {68667#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {68667#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {68667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {68667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {68667#false} ~skip~0 := 0; {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 53: Hoare triple {68667#false} assume !false; {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {68667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {68667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {68667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {68667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {68667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {68667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {68667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 61: Hoare triple {68667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 62: Hoare triple {68667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 63: Hoare triple {68667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 64: Hoare triple {68667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 65: Hoare triple {68667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {68667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {68667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {68667#false} assume 8512 == #t~mem60;havoc #t~mem60; {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {68667#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {68667#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 71: Hoare triple {68667#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 72: Hoare triple {68667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 73: Hoare triple {68667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {68667#false} ~skip~0 := 0; {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {68667#false} assume !false; {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 76: Hoare triple {68667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 77: Hoare triple {68667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,781 INFO L290 TraceCheckUtils]: 78: Hoare triple {68667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 79: Hoare triple {68667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 80: Hoare triple {68667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 81: Hoare triple {68667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 82: Hoare triple {68667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 83: Hoare triple {68667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 84: Hoare triple {68667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 85: Hoare triple {68667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 86: Hoare triple {68667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 87: Hoare triple {68667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 88: Hoare triple {68667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 89: Hoare triple {68667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,782 INFO L290 TraceCheckUtils]: 90: Hoare triple {68667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 91: Hoare triple {68667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 92: Hoare triple {68667#false} assume 8528 == #t~mem62;havoc #t~mem62; {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {68667#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {68667#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {68667#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {68667#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {68667#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 4294967296); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {68667#false} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {68667#false} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {68667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,783 INFO L290 TraceCheckUtils]: 101: Hoare triple {68667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 102: Hoare triple {68667#false} ~skip~0 := 0; {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 103: Hoare triple {68667#false} assume !false; {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 104: Hoare triple {68667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 105: Hoare triple {68667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 106: Hoare triple {68667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 107: Hoare triple {68667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 108: Hoare triple {68667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 109: Hoare triple {68667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 110: Hoare triple {68667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 111: Hoare triple {68667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 112: Hoare triple {68667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,784 INFO L290 TraceCheckUtils]: 113: Hoare triple {68667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 114: Hoare triple {68667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 115: Hoare triple {68667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 116: Hoare triple {68667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 117: Hoare triple {68667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 118: Hoare triple {68667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 119: Hoare triple {68667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 120: Hoare triple {68667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 121: Hoare triple {68667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 122: Hoare triple {68667#false} assume 8544 == #t~mem64;havoc #t~mem64; {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {68667#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 124: Hoare triple {68667#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,785 INFO L290 TraceCheckUtils]: 125: Hoare triple {68667#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {68667#false} is VALID [2022-04-27 15:33:20,786 INFO L290 TraceCheckUtils]: 126: Hoare triple {68667#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {68667#false} is VALID [2022-04-27 15:33:20,786 INFO L290 TraceCheckUtils]: 127: Hoare triple {68667#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {68667#false} is VALID [2022-04-27 15:33:20,786 INFO L290 TraceCheckUtils]: 128: Hoare triple {68667#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {68667#false} is VALID [2022-04-27 15:33:20,786 INFO L290 TraceCheckUtils]: 129: Hoare triple {68667#false} assume 8 == ~blastFlag~0; {68667#false} is VALID [2022-04-27 15:33:20,786 INFO L290 TraceCheckUtils]: 130: Hoare triple {68667#false} assume !false; {68667#false} is VALID [2022-04-27 15:33:20,786 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-27 15:33:20,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:20,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032365151] [2022-04-27 15:33:20,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032365151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:20,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:20,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:33:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710699916] [2022-04-27 15:33:20,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:20,787 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-27 15:33:20,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:20,788 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-27 15:33:20,871 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-27 15:33:20,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:33:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:33:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:33:20,873 INFO L87 Difference]: Start difference. First operand 883 states and 1311 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-27 15:33:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:24,669 INFO L93 Difference]: Finished difference Result 1742 states and 2595 transitions. [2022-04-27 15:33:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:33:24,670 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-27 15:33:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:24,670 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-27 15:33:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:33:24,671 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-27 15:33:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-27 15:33:24,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-27 15:33:24,935 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-27 15:33:24,962 INFO L225 Difference]: With dead ends: 1742 [2022-04-27 15:33:24,962 INFO L226 Difference]: Without dead ends: 885 [2022-04-27 15:33:24,963 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-27 15:33:24,964 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:24,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:33:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-04-27 15:33:24,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2022-04-27 15:33:24,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:24,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:24,980 INFO L74 IsIncluded]: Start isIncluded. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:24,981 INFO L87 Difference]: Start difference. First operand 885 states. Second operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:25,014 INFO L93 Difference]: Finished difference Result 885 states and 1313 transitions. [2022-04-27 15:33:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-27 15:33:25,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:25,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:25,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 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 885 states. [2022-04-27 15:33:25,018 INFO L87 Difference]: Start difference. First operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 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 885 states. [2022-04-27 15:33:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:25,043 INFO L93 Difference]: Finished difference Result 885 states and 1313 transitions. [2022-04-27 15:33:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-27 15:33:25,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:25,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:25,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:25,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1313 transitions. [2022-04-27 15:33:25,069 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1313 transitions. Word has length 131 [2022-04-27 15:33:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:25,069 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1313 transitions. [2022-04-27 15:33:25,070 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-27 15:33:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1313 transitions. [2022-04-27 15:33:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-27 15:33:25,071 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:25,071 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-27 15:33:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-27 15:33:25,071 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 1 times [2022-04-27 15:33:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:25,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432801551] [2022-04-27 15:33:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:25,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:25,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {73355#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73349#true} is VALID [2022-04-27 15:33:25,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-27 15:33:25,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73349#true} {73349#true} #689#return; {73349#true} is VALID [2022-04-27 15:33:25,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73355#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:25,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {73355#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73349#true} is VALID [2022-04-27 15:33:25,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-27 15:33:25,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #689#return; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret161 := main(); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {73349#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L272 TraceCheckUtils]: 7: Hoare triple {73349#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {73349#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {73349#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {73349#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {73349#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {73349#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {73349#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {73349#true} assume !false; {73349#true} is VALID [2022-04-27 15:33:25,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {73349#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {73349#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {73349#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {73349#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {73349#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {73349#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {73349#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {73349#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {73349#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {73349#true} assume 8464 == #t~mem55;havoc #t~mem55; {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {73349#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {73349#true} is VALID [2022-04-27 15:33:25,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {73349#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {73349#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {73349#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {73349#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {73349#true} ~skip~0 := 0; {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {73349#true} assume !false; {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {73349#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {73349#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {73349#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {73349#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {73349#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {73349#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {73349#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {73349#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {73349#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {73349#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {73349#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {73349#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {73349#true} assume 8496 == #t~mem58;havoc #t~mem58; {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {73349#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {73349#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {73349#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {73349#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {73349#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 50: Hoare triple {73349#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {73349#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73349#true} is VALID [2022-04-27 15:33:25,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {73349#true} ~skip~0 := 0; {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {73349#true} assume !false; {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {73349#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {73349#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 56: Hoare triple {73349#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 57: Hoare triple {73349#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 58: Hoare triple {73349#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 59: Hoare triple {73349#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {73349#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {73349#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {73349#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {73349#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {73349#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {73349#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {73349#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {73349#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {73349#true} assume 8512 == #t~mem60;havoc #t~mem60; {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 69: Hoare triple {73349#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {73349#true} is VALID [2022-04-27 15:33:25,244 INFO L290 TraceCheckUtils]: 70: Hoare triple {73349#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {73349#true} is VALID [2022-04-27 15:33:25,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {73349#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,246 INFO L290 TraceCheckUtils]: 75: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,246 INFO L290 TraceCheckUtils]: 76: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,246 INFO L290 TraceCheckUtils]: 77: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,247 INFO L290 TraceCheckUtils]: 78: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,247 INFO L290 TraceCheckUtils]: 79: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,247 INFO L290 TraceCheckUtils]: 80: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,248 INFO L290 TraceCheckUtils]: 81: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,248 INFO L290 TraceCheckUtils]: 82: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,248 INFO L290 TraceCheckUtils]: 83: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,249 INFO L290 TraceCheckUtils]: 84: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,249 INFO L290 TraceCheckUtils]: 85: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,250 INFO L290 TraceCheckUtils]: 87: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,250 INFO L290 TraceCheckUtils]: 88: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,250 INFO L290 TraceCheckUtils]: 90: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,251 INFO L290 TraceCheckUtils]: 93: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,252 INFO L290 TraceCheckUtils]: 94: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,252 INFO L290 TraceCheckUtils]: 95: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,252 INFO L290 TraceCheckUtils]: 96: Hoare triple {73354#(<= 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))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,253 INFO L290 TraceCheckUtils]: 97: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,253 INFO L290 TraceCheckUtils]: 98: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,253 INFO L290 TraceCheckUtils]: 99: Hoare triple {73354#(<= 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))) % 4294967296); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,254 INFO L290 TraceCheckUtils]: 100: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 4294967296);~skip~0 := 1; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,254 INFO L290 TraceCheckUtils]: 103: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,255 INFO L290 TraceCheckUtils]: 104: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,255 INFO L290 TraceCheckUtils]: 105: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,255 INFO L290 TraceCheckUtils]: 106: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,257 INFO L290 TraceCheckUtils]: 110: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,257 INFO L290 TraceCheckUtils]: 111: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,257 INFO L290 TraceCheckUtils]: 112: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,257 INFO L290 TraceCheckUtils]: 113: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,258 INFO L290 TraceCheckUtils]: 114: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,258 INFO L290 TraceCheckUtils]: 115: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,258 INFO L290 TraceCheckUtils]: 116: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,259 INFO L290 TraceCheckUtils]: 117: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,259 INFO L290 TraceCheckUtils]: 118: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,259 INFO L290 TraceCheckUtils]: 119: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,260 INFO L290 TraceCheckUtils]: 120: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,260 INFO L290 TraceCheckUtils]: 121: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,260 INFO L290 TraceCheckUtils]: 122: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,260 INFO L290 TraceCheckUtils]: 123: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,261 INFO L290 TraceCheckUtils]: 124: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,261 INFO L290 TraceCheckUtils]: 125: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,261 INFO L290 TraceCheckUtils]: 126: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,262 INFO L290 TraceCheckUtils]: 127: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,262 INFO L290 TraceCheckUtils]: 128: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,262 INFO L290 TraceCheckUtils]: 129: Hoare triple {73354#(<= 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))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,262 INFO L290 TraceCheckUtils]: 130: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {73354#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-27 15:33:25,263 INFO L290 TraceCheckUtils]: 131: Hoare triple {73354#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {73350#false} is VALID [2022-04-27 15:33:25,263 INFO L290 TraceCheckUtils]: 132: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-27 15:33:25,263 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-27 15:33:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:25,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432801551] [2022-04-27 15:33:25,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432801551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:25,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:25,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:33:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783186140] [2022-04-27 15:33:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:25,265 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-27 15:33:25,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:25,266 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-27 15:33:25,343 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-27 15:33:25,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:33:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:33:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:33:25,344 INFO L87 Difference]: Start difference. First operand 885 states and 1313 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-27 15:33:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:30,708 INFO L93 Difference]: Finished difference Result 2181 states and 3257 transitions. [2022-04-27 15:33:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:33:30,708 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-27 15:33:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:30,709 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-27 15:33:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:33:30,711 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-27 15:33:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-27 15:33:30,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-27 15:33:31,113 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-27 15:33:31,166 INFO L225 Difference]: With dead ends: 2181 [2022-04-27 15:33:31,166 INFO L226 Difference]: Without dead ends: 1324 [2022-04-27 15:33:31,166 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-27 15:33:31,167 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:31,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 15:33:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-04-27 15:33:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1322. [2022-04-27 15:33:31,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:31,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:31,229 INFO L74 IsIncluded]: Start isIncluded. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:31,230 INFO L87 Difference]: Start difference. First operand 1324 states. Second operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:31,296 INFO L93 Difference]: Finished difference Result 1324 states and 1974 transitions. [2022-04-27 15:33:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1974 transitions. [2022-04-27 15:33:31,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:31,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:31,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 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 1324 states. [2022-04-27 15:33:31,300 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 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 1324 states. [2022-04-27 15:33:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:31,369 INFO L93 Difference]: Finished difference Result 1324 states and 1974 transitions. [2022-04-27 15:33:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1974 transitions. [2022-04-27 15:33:31,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:31,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:31,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:31,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4950645406226273) internal successors, (1969), 1317 states have internal predecessors, (1969), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1973 transitions. [2022-04-27 15:33:31,451 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1973 transitions. Word has length 133 [2022-04-27 15:33:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:31,452 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1973 transitions. [2022-04-27 15:33:31,452 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-27 15:33:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1973 transitions. [2022-04-27 15:33:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-27 15:33:31,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:31,453 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-27 15:33:31,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-27 15:33:31,453 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 1 times [2022-04-27 15:33:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:31,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646635333] [2022-04-27 15:33:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:31,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:31,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {79877#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79871#true} is VALID [2022-04-27 15:33:31,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {79871#true} assume true; {79871#true} is VALID [2022-04-27 15:33:31,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79871#true} {79871#true} #689#return; {79871#true} is VALID [2022-04-27 15:33:31,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {79871#true} call ULTIMATE.init(); {79877#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:31,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {79877#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {79871#true} is VALID [2022-04-27 15:33:31,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {79871#true} assume true; {79871#true} is VALID [2022-04-27 15:33:31,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79871#true} {79871#true} #689#return; {79871#true} is VALID [2022-04-27 15:33:31,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {79871#true} call #t~ret161 := main(); {79871#true} is VALID [2022-04-27 15:33:31,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {79871#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {79871#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L272 TraceCheckUtils]: 7: Hoare triple {79871#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {79871#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {79871#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {79871#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {79871#true} is VALID [2022-04-27 15:33:31,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {79871#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {79871#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {79871#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {79871#true} assume !false; {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {79871#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {79871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {79871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {79871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {79871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {79871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {79871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {79871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {79871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {79871#true} assume 8464 == #t~mem55;havoc #t~mem55; {79871#true} is VALID [2022-04-27 15:33:31,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {79871#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {79871#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {79871#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {79871#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {79871#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {79871#true} ~skip~0 := 0; {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {79871#true} assume !false; {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {79871#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {79871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {79871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {79871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {79871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {79871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {79871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {79871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {79871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {79871#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {79871#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {79871#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 44: Hoare triple {79871#true} assume 8496 == #t~mem58;havoc #t~mem58; {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {79871#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {79871#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {79871#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {79871#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {79871#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 50: Hoare triple {79871#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {79871#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79871#true} is VALID [2022-04-27 15:33:31,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {79871#true} ~skip~0 := 0; {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {79871#true} assume !false; {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {79871#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {79871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {79871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {79871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {79871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {79871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {79871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {79871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {79871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {79871#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {79871#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {79871#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {79871#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {79871#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {79871#true} assume 8512 == #t~mem60;havoc #t~mem60; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {79871#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {79871#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {79871#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {79871#true} assume !(~ret~0 <= 0); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {79871#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {79871#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 75: Hoare triple {79871#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {79871#true} ~skip~0 := 0; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {79871#true} assume !false; {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {79871#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {79871#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {79871#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {79871#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {79871#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 83: Hoare triple {79871#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 84: Hoare triple {79871#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 85: Hoare triple {79871#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 86: Hoare triple {79871#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {79871#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 88: Hoare triple {79871#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 89: Hoare triple {79871#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 90: Hoare triple {79871#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 91: Hoare triple {79871#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 92: Hoare triple {79871#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {79871#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,624 INFO L290 TraceCheckUtils]: 94: Hoare triple {79871#true} assume 8528 == #t~mem62;havoc #t~mem62; {79871#true} is VALID [2022-04-27 15:33:31,624 INFO L290 TraceCheckUtils]: 95: Hoare triple {79871#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,624 INFO L290 TraceCheckUtils]: 96: Hoare triple {79871#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {79871#true} is VALID [2022-04-27 15:33:31,624 INFO L290 TraceCheckUtils]: 97: Hoare triple {79871#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {79871#true} is VALID [2022-04-27 15:33:31,624 INFO L290 TraceCheckUtils]: 98: Hoare triple {79871#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {79871#true} is VALID [2022-04-27 15:33:31,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {79871#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {79871#true} is VALID [2022-04-27 15:33:31,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {79871#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,631 INFO L290 TraceCheckUtils]: 103: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,631 INFO L290 TraceCheckUtils]: 104: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,632 INFO L290 TraceCheckUtils]: 105: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,632 INFO L290 TraceCheckUtils]: 106: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,632 INFO L290 TraceCheckUtils]: 107: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,633 INFO L290 TraceCheckUtils]: 108: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,633 INFO L290 TraceCheckUtils]: 109: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,633 INFO L290 TraceCheckUtils]: 110: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,633 INFO L290 TraceCheckUtils]: 111: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,634 INFO L290 TraceCheckUtils]: 112: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,634 INFO L290 TraceCheckUtils]: 113: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,634 INFO L290 TraceCheckUtils]: 114: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,635 INFO L290 TraceCheckUtils]: 115: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,635 INFO L290 TraceCheckUtils]: 116: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,635 INFO L290 TraceCheckUtils]: 117: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,636 INFO L290 TraceCheckUtils]: 118: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,636 INFO L290 TraceCheckUtils]: 119: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,636 INFO L290 TraceCheckUtils]: 120: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,636 INFO L290 TraceCheckUtils]: 121: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,637 INFO L290 TraceCheckUtils]: 122: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,637 INFO L290 TraceCheckUtils]: 123: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,637 INFO L290 TraceCheckUtils]: 124: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,638 INFO L290 TraceCheckUtils]: 125: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,638 INFO L290 TraceCheckUtils]: 126: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,638 INFO L290 TraceCheckUtils]: 127: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,639 INFO L290 TraceCheckUtils]: 128: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,639 INFO L290 TraceCheckUtils]: 129: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,639 INFO L290 TraceCheckUtils]: 130: Hoare triple {79876#(<= 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))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,639 INFO L290 TraceCheckUtils]: 131: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {79876#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-27 15:33:31,640 INFO L290 TraceCheckUtils]: 132: Hoare triple {79876#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {79872#false} is VALID [2022-04-27 15:33:31,640 INFO L290 TraceCheckUtils]: 133: Hoare triple {79872#false} assume !false; {79872#false} is VALID [2022-04-27 15:33:31,640 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-27 15:33:31,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:31,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646635333] [2022-04-27 15:33:31,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646635333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:31,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:31,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:33:31,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874395599] [2022-04-27 15:33:31,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:31,642 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-27 15:33:31,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:31,642 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-27 15:33:31,719 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-27 15:33:31,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:33:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:31,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:33:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:33:31,721 INFO L87 Difference]: Start difference. First operand 1322 states and 1973 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-27 15:33:33,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:33:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:36,447 INFO L93 Difference]: Finished difference Result 1763 states and 2637 transitions. [2022-04-27 15:33:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:33:36,447 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-27 15:33:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:36,448 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-27 15:33:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-27 15:33:36,450 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-27 15:33:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-27 15:33:36,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-27 15:33:36,734 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-27 15:33:36,836 INFO L225 Difference]: With dead ends: 1763 [2022-04-27 15:33:36,836 INFO L226 Difference]: Without dead ends: 1761 [2022-04-27 15:33:36,836 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-27 15:33:36,837 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:36,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:33:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-04-27 15:33:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1759. [2022-04-27 15:33:36,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:36,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:36,960 INFO L74 IsIncluded]: Start isIncluded. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:36,961 INFO L87 Difference]: Start difference. First operand 1761 states. Second operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:37,049 INFO L93 Difference]: Finished difference Result 1761 states and 2635 transitions. [2022-04-27 15:33:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2635 transitions. [2022-04-27 15:33:37,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:37,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 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 1761 states. [2022-04-27 15:33:37,054 INFO L87 Difference]: Start difference. First operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 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 1761 states. [2022-04-27 15:33:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:37,174 INFO L93 Difference]: Finished difference Result 1761 states and 2635 transitions. [2022-04-27 15:33:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2635 transitions. [2022-04-27 15:33:37,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:37,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:37,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:37,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1754 states have (on average 1.499429874572406) internal successors, (2630), 1754 states have internal predecessors, (2630), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2634 transitions. [2022-04-27 15:33:37,300 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2634 transitions. Word has length 134 [2022-04-27 15:33:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:37,301 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2634 transitions. [2022-04-27 15:33:37,301 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-27 15:33:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2634 transitions. [2022-04-27 15:33:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-27 15:33:37,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:37,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 15:33:37,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-27 15:33:37,303 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -924650012, now seen corresponding path program 1 times [2022-04-27 15:33:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:37,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126176821] [2022-04-27 15:33:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:37,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {87291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87284#true} is VALID [2022-04-27 15:33:37,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {87284#true} assume true; {87284#true} is VALID [2022-04-27 15:33:37,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87284#true} {87284#true} #689#return; {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {87284#true} call ULTIMATE.init(); {87291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:37,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {87291#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {87284#true} assume true; {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87284#true} {87284#true} #689#return; {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {87284#true} call #t~ret161 := main(); {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {87284#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {87284#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L272 TraceCheckUtils]: 7: Hoare triple {87284#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87284#true} is VALID [2022-04-27 15:33:37,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {87284#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {87284#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {87284#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {87284#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {87284#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {87284#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {87284#true} assume !false; {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {87284#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {87284#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {87284#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {87284#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {87284#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {87284#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {87284#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {87284#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {87284#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {87284#true} assume 8464 == #t~mem55;havoc #t~mem55; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {87284#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {87284#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {87284#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {87284#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {87284#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {87284#true} ~skip~0 := 0; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {87284#true} assume !false; {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {87284#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {87284#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {87284#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {87284#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {87284#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {87284#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {87284#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {87284#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {87284#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {87284#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 42: Hoare triple {87284#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {87284#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {87284#true} assume 8496 == #t~mem58;havoc #t~mem58; {87284#true} is VALID [2022-04-27 15:33:37,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {87284#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {87284#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {87284#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {87284#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {87284#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {87284#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {87284#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 52: Hoare triple {87284#true} ~skip~0 := 0; {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {87284#true} assume !false; {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {87284#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {87284#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {87284#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 57: Hoare triple {87284#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {87284#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {87284#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {87284#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {87284#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {87284#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 63: Hoare triple {87284#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {87284#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {87284#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {87284#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 67: Hoare triple {87284#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 68: Hoare triple {87284#true} assume 8512 == #t~mem60;havoc #t~mem60; {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 69: Hoare triple {87284#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {87284#true} is VALID [2022-04-27 15:33:37,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {87284#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {87284#true} is VALID [2022-04-27 15:33:37,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {87284#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {87284#true} is VALID [2022-04-27 15:33:37,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {87284#true} assume !(~ret~0 <= 0); {87284#true} is VALID [2022-04-27 15:33:37,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {87284#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,456 INFO L290 TraceCheckUtils]: 75: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,456 INFO L290 TraceCheckUtils]: 76: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,456 INFO L290 TraceCheckUtils]: 77: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,457 INFO L290 TraceCheckUtils]: 79: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,458 INFO L290 TraceCheckUtils]: 82: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,459 INFO L290 TraceCheckUtils]: 83: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,459 INFO L290 TraceCheckUtils]: 84: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,461 INFO L290 TraceCheckUtils]: 87: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,461 INFO L290 TraceCheckUtils]: 88: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,461 INFO L290 TraceCheckUtils]: 89: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,462 INFO L290 TraceCheckUtils]: 90: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,462 INFO L290 TraceCheckUtils]: 91: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,463 INFO L290 TraceCheckUtils]: 92: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,464 INFO L290 TraceCheckUtils]: 94: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,464 INFO L290 TraceCheckUtils]: 95: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,464 INFO L290 TraceCheckUtils]: 96: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,465 INFO L290 TraceCheckUtils]: 97: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,465 INFO L290 TraceCheckUtils]: 98: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 99: Hoare triple {87289#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87290#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 100: Hoare triple {87290#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {87285#false} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {87285#false} assume !(~num1~0 > 0); {87285#false} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {87285#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {87285#false} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 103: Hoare triple {87285#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 104: Hoare triple {87285#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87285#false} is VALID [2022-04-27 15:33:37,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {87285#false} ~skip~0 := 0; {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 106: Hoare triple {87285#false} assume !false; {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 107: Hoare triple {87285#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 108: Hoare triple {87285#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 109: Hoare triple {87285#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 110: Hoare triple {87285#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 111: Hoare triple {87285#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 112: Hoare triple {87285#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 113: Hoare triple {87285#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 114: Hoare triple {87285#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 115: Hoare triple {87285#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 116: Hoare triple {87285#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,467 INFO L290 TraceCheckUtils]: 117: Hoare triple {87285#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 118: Hoare triple {87285#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 119: Hoare triple {87285#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 120: Hoare triple {87285#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 121: Hoare triple {87285#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 122: Hoare triple {87285#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 123: Hoare triple {87285#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 124: Hoare triple {87285#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 125: Hoare triple {87285#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 126: Hoare triple {87285#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 127: Hoare triple {87285#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 128: Hoare triple {87285#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 129: Hoare triple {87285#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,468 INFO L290 TraceCheckUtils]: 130: Hoare triple {87285#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 131: Hoare triple {87285#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 132: Hoare triple {87285#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 133: Hoare triple {87285#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 134: Hoare triple {87285#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 135: Hoare triple {87285#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 136: Hoare triple {87285#false} assume 8640 == #t~mem75;havoc #t~mem75; {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 137: Hoare triple {87285#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 138: Hoare triple {87285#false} assume 4 == ~blastFlag~0; {87285#false} is VALID [2022-04-27 15:33:37,469 INFO L290 TraceCheckUtils]: 139: Hoare triple {87285#false} assume !false; {87285#false} is VALID [2022-04-27 15:33:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 15:33:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:37,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126176821] [2022-04-27 15:33:37,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126176821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:37,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:37,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:33:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667342416] [2022-04-27 15:33:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 140 [2022-04-27 15:33:37,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:37,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:37,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:33:37,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:33:37,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:33:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:33:37,550 INFO L87 Difference]: Start difference. First operand 1759 states and 2634 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:43,303 INFO L93 Difference]: Finished difference Result 4083 states and 6108 transitions. [2022-04-27 15:33:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:33:43,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 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 140 [2022-04-27 15:33:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-27 15:33:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-04-27 15:33:43,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 580 transitions. [2022-04-27 15:33:43,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 580 edges. 580 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:33:43,910 INFO L225 Difference]: With dead ends: 4083 [2022-04-27 15:33:43,910 INFO L226 Difference]: Without dead ends: 2352 [2022-04-27 15:33:43,911 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-27 15:33:43,912 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 120 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:43,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 376 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:33:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2022-04-27 15:33:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1995. [2022-04-27 15:33:44,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:44,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2352 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:44,068 INFO L74 IsIncluded]: Start isIncluded. First operand 2352 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:44,069 INFO L87 Difference]: Start difference. First operand 2352 states. Second operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:44,202 INFO L93 Difference]: Finished difference Result 2352 states and 3491 transitions. [2022-04-27 15:33:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3491 transitions. [2022-04-27 15:33:44,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:44,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:44,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 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 2352 states. [2022-04-27 15:33:44,207 INFO L87 Difference]: Start difference. First operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 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 2352 states. [2022-04-27 15:33:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:44,339 INFO L93 Difference]: Finished difference Result 2352 states and 3491 transitions. [2022-04-27 15:33:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3491 transitions. [2022-04-27 15:33:44,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:44,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:44,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:44,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1990 states have (on average 1.4969849246231155) internal successors, (2979), 1990 states have internal predecessors, (2979), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2983 transitions. [2022-04-27 15:33:44,451 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2983 transitions. Word has length 140 [2022-04-27 15:33:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:44,452 INFO L495 AbstractCegarLoop]: Abstraction has 1995 states and 2983 transitions. [2022-04-27 15:33:44,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2983 transitions. [2022-04-27 15:33:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-27 15:33:44,453 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:44,453 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2022-04-27 15:33:44,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-27 15:33:44,453 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash -516884985, now seen corresponding path program 1 times [2022-04-27 15:33:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:44,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109296539] [2022-04-27 15:33:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:44,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:44,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {98714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {98707#true} is VALID [2022-04-27 15:33:44,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {98707#true} assume true; {98707#true} is VALID [2022-04-27 15:33:44,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98707#true} {98707#true} #689#return; {98707#true} is VALID [2022-04-27 15:33:44,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {98707#true} call ULTIMATE.init(); {98714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:44,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {98714#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {98707#true} assume true; {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98707#true} {98707#true} #689#return; {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {98707#true} call #t~ret161 := main(); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {98707#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {98707#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L272 TraceCheckUtils]: 7: Hoare triple {98707#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {98707#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {98707#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {98707#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {98707#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {98707#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {98707#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {98707#true} assume !false; {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {98707#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {98707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {98707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {98707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {98707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {98707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {98707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {98707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {98707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {98707#true} assume 8464 == #t~mem55;havoc #t~mem55; {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {98707#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {98707#true} is VALID [2022-04-27 15:33:44,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {98707#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {98707#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {98707#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {98707#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {98707#true} ~skip~0 := 0; {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {98707#true} assume !false; {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {98707#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {98707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {98707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {98707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {98707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {98707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {98707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {98707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {98707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {98707#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {98707#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 43: Hoare triple {98707#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {98707#true} assume 8496 == #t~mem58;havoc #t~mem58; {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 45: Hoare triple {98707#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {98707#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {98707#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {98707#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {98707#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {98707#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {98707#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {98707#true} ~skip~0 := 0; {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {98707#true} assume !false; {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {98707#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {98707#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {98707#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {98707#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {98707#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 59: Hoare triple {98707#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {98707#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {98707#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {98707#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 63: Hoare triple {98707#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,614 INFO L290 TraceCheckUtils]: 64: Hoare triple {98707#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 65: Hoare triple {98707#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 66: Hoare triple {98707#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 67: Hoare triple {98707#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 68: Hoare triple {98707#true} assume 8512 == #t~mem60;havoc #t~mem60; {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {98707#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 70: Hoare triple {98707#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 71: Hoare triple {98707#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {98707#true} is VALID [2022-04-27 15:33:44,615 INFO L290 TraceCheckUtils]: 72: Hoare triple {98707#true} assume !(~ret~0 <= 0); {98707#true} is VALID [2022-04-27 15:33:44,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {98707#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,618 INFO L290 TraceCheckUtils]: 77: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,618 INFO L290 TraceCheckUtils]: 78: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,619 INFO L290 TraceCheckUtils]: 79: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,619 INFO L290 TraceCheckUtils]: 80: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,619 INFO L290 TraceCheckUtils]: 81: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,620 INFO L290 TraceCheckUtils]: 82: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,620 INFO L290 TraceCheckUtils]: 83: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,621 INFO L290 TraceCheckUtils]: 84: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,621 INFO L290 TraceCheckUtils]: 85: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,622 INFO L290 TraceCheckUtils]: 86: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,622 INFO L290 TraceCheckUtils]: 87: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,622 INFO L290 TraceCheckUtils]: 88: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,623 INFO L290 TraceCheckUtils]: 89: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,623 INFO L290 TraceCheckUtils]: 90: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,624 INFO L290 TraceCheckUtils]: 92: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {98712#(= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98713#(= |ssl3_accept_#t~mem62| 8528)} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 94: Hoare triple {98713#(= |ssl3_accept_#t~mem62| 8528)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {98708#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {98708#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {98708#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {98708#false} assume 8560 == #t~mem66;havoc #t~mem66; {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 99: Hoare triple {98708#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 100: Hoare triple {98708#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {98708#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 102: Hoare triple {98708#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 103: Hoare triple {98708#false} ~skip~0 := 0; {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 104: Hoare triple {98708#false} assume !false; {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 105: Hoare triple {98708#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 106: Hoare triple {98708#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 107: Hoare triple {98708#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 108: Hoare triple {98708#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 109: Hoare triple {98708#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 110: Hoare triple {98708#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 111: Hoare triple {98708#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 112: Hoare triple {98708#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 113: Hoare triple {98708#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,626 INFO L290 TraceCheckUtils]: 114: Hoare triple {98708#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 115: Hoare triple {98708#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 116: Hoare triple {98708#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 117: Hoare triple {98708#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {98708#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 119: Hoare triple {98708#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 120: Hoare triple {98708#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 121: Hoare triple {98708#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 122: Hoare triple {98708#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 123: Hoare triple {98708#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 124: Hoare triple {98708#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 125: Hoare triple {98708#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 126: Hoare triple {98708#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,627 INFO L290 TraceCheckUtils]: 127: Hoare triple {98708#false} assume 8448 == #t~mem68;havoc #t~mem68; {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 128: Hoare triple {98708#false} assume !(~num1~0 > 0); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 129: Hoare triple {98708#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 130: Hoare triple {98708#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 131: Hoare triple {98708#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 132: Hoare triple {98708#false} ~skip~0 := 0; {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 133: Hoare triple {98708#false} assume !false; {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 134: Hoare triple {98708#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 135: Hoare triple {98708#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 136: Hoare triple {98708#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 137: Hoare triple {98708#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {98708#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,628 INFO L290 TraceCheckUtils]: 139: Hoare triple {98708#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 140: Hoare triple {98708#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 141: Hoare triple {98708#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 142: Hoare triple {98708#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 143: Hoare triple {98708#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 144: Hoare triple {98708#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 145: Hoare triple {98708#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 146: Hoare triple {98708#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 147: Hoare triple {98708#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 148: Hoare triple {98708#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 149: Hoare triple {98708#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 150: Hoare triple {98708#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 151: Hoare triple {98708#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,629 INFO L290 TraceCheckUtils]: 152: Hoare triple {98708#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 153: Hoare triple {98708#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 154: Hoare triple {98708#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 155: Hoare triple {98708#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 156: Hoare triple {98708#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 157: Hoare triple {98708#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 158: Hoare triple {98708#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 159: Hoare triple {98708#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 160: Hoare triple {98708#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 161: Hoare triple {98708#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 162: Hoare triple {98708#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 163: Hoare triple {98708#false} assume 8640 == #t~mem75;havoc #t~mem75; {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 164: Hoare triple {98708#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {98708#false} is VALID [2022-04-27 15:33:44,630 INFO L290 TraceCheckUtils]: 165: Hoare triple {98708#false} assume 4 == ~blastFlag~0; {98708#false} is VALID [2022-04-27 15:33:44,631 INFO L290 TraceCheckUtils]: 166: Hoare triple {98708#false} assume !false; {98708#false} is VALID [2022-04-27 15:33:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-27 15:33:44,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:44,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109296539] [2022-04-27 15:33:44,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109296539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:44,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:44,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:33:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783766315] [2022-04-27 15:33:44,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:44,632 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 167 [2022-04-27 15:33:44,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:44,633 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-27 15:33:44,731 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-27 15:33:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:33:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:33:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:33:44,732 INFO L87 Difference]: Start difference. First operand 1995 states and 2983 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-27 15:33:51,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:33:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:53,462 INFO L93 Difference]: Finished difference Result 4058 states and 6063 transitions. [2022-04-27 15:33:53,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:33:53,462 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 167 [2022-04-27 15:33:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:33:53,462 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-27 15:33:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-27 15:33:53,464 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-27 15:33:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-04-27 15:33:53,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-04-27 15:33:53,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:33:53,931 INFO L225 Difference]: With dead ends: 4058 [2022-04-27 15:33:53,932 INFO L226 Difference]: Without dead ends: 2091 [2022-04-27 15:33:53,933 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-27 15:33:53,933 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 38 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 15:33:53,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 568 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 15:33:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-27 15:33:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1995. [2022-04-27 15:33:54,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:33:54,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:54,077 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:54,078 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:54,226 INFO L93 Difference]: Finished difference Result 2091 states and 3108 transitions. [2022-04-27 15:33:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3108 transitions. [2022-04-27 15:33:54,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:54,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:54,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 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 2091 states. [2022-04-27 15:33:54,231 INFO L87 Difference]: Start difference. First operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 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 2091 states. [2022-04-27 15:33:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:33:54,350 INFO L93 Difference]: Finished difference Result 2091 states and 3108 transitions. [2022-04-27 15:33:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3108 transitions. [2022-04-27 15:33:54,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:33:54,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:33:54,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:33:54,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:33:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1990 states have (on average 1.4949748743718594) internal successors, (2975), 1990 states have internal predecessors, (2975), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2979 transitions. [2022-04-27 15:33:54,501 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2979 transitions. Word has length 167 [2022-04-27 15:33:54,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:33:54,501 INFO L495 AbstractCegarLoop]: Abstraction has 1995 states and 2979 transitions. [2022-04-27 15:33:54,501 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-27 15:33:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2979 transitions. [2022-04-27 15:33:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-27 15:33:54,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:33:54,503 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2022-04-27 15:33:54,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-27 15:33:54,503 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:33:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:33:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1391450317, now seen corresponding path program 1 times [2022-04-27 15:33:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:33:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577392965] [2022-04-27 15:33:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:33:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:33:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:54,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:33:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:33:54,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {109559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109551#true} is VALID [2022-04-27 15:33:54,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {109551#true} assume true; {109551#true} is VALID [2022-04-27 15:33:54,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109551#true} {109551#true} #689#return; {109551#true} is VALID [2022-04-27 15:33:54,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {109551#true} call ULTIMATE.init(); {109559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:33:54,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {109559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {109551#true} assume true; {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109551#true} {109551#true} #689#return; {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {109551#true} call #t~ret161 := main(); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {109551#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {109551#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L272 TraceCheckUtils]: 7: Hoare triple {109551#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {109551#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {109551#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {109551#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {109551#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {109551#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {109551#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {109551#true} assume !false; {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {109551#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {109551#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {109551#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {109551#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {109551#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {109551#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {109551#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {109551#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {109551#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {109551#true} assume 8464 == #t~mem55;havoc #t~mem55; {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {109551#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {109551#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {109551#true} is VALID [2022-04-27 15:33:54,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {109551#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {109551#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {109551#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {109551#true} ~skip~0 := 0; {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {109551#true} assume !false; {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {109551#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {109551#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {109551#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {109551#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {109551#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {109551#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {109551#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {109551#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {109551#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {109551#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {109551#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {109551#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {109551#true} assume 8496 == #t~mem58;havoc #t~mem58; {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {109551#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {109551#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {109551#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {109551#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {109551#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {109551#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {109551#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {109551#true} ~skip~0 := 0; {109551#true} is VALID [2022-04-27 15:33:54,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {109551#true} assume !false; {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {109551#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {109551#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {109551#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {109551#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {109551#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {109551#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {109551#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {109551#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {109551#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {109551#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {109551#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {109551#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {109551#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {109551#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {109551#true} assume 8512 == #t~mem60;havoc #t~mem60; {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {109551#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {109551#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {109551#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {109551#true} assume !(~ret~0 <= 0); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {109551#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {109551#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {109551#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {109551#true} ~skip~0 := 0; {109551#true} is VALID [2022-04-27 15:33:54,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {109551#true} assume !false; {109551#true} is VALID [2022-04-27 15:33:54,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {109551#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109556#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:33:54,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {109556#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 8192 == #t~mem49;havoc #t~mem49; {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,667 INFO L290 TraceCheckUtils]: 86: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:33:54,667 INFO L290 TraceCheckUtils]: 87: Hoare triple {109557#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {109558#(not (= 12292 |ssl3_accept_#t~mem85|))} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {109558#(not (= 12292 |ssl3_accept_#t~mem85|))} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {109552#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {109552#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 91: Hoare triple {109552#false} ~skip~0 := 0; {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 92: Hoare triple {109552#false} assume !false; {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 93: Hoare triple {109552#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 94: Hoare triple {109552#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 95: Hoare triple {109552#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 96: Hoare triple {109552#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {109552#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 98: Hoare triple {109552#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 99: Hoare triple {109552#false} assume 8480 == #t~mem52;havoc #t~mem52; {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 100: Hoare triple {109552#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 101: Hoare triple {109552#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 102: Hoare triple {109552#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 103: Hoare triple {109552#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 104: Hoare triple {109552#false} ~skip~0 := 0; {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 105: Hoare triple {109552#false} assume !false; {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 106: Hoare triple {109552#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 107: Hoare triple {109552#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 108: Hoare triple {109552#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 109: Hoare triple {109552#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 110: Hoare triple {109552#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,669 INFO L290 TraceCheckUtils]: 111: Hoare triple {109552#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 112: Hoare triple {109552#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 113: Hoare triple {109552#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 114: Hoare triple {109552#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 115: Hoare triple {109552#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 116: Hoare triple {109552#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 117: Hoare triple {109552#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 118: Hoare triple {109552#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 119: Hoare triple {109552#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 120: Hoare triple {109552#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 121: Hoare triple {109552#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 122: Hoare triple {109552#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 123: Hoare triple {109552#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,670 INFO L290 TraceCheckUtils]: 124: Hoare triple {109552#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 125: Hoare triple {109552#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 126: Hoare triple {109552#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 127: Hoare triple {109552#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 128: Hoare triple {109552#false} assume 8448 == #t~mem68;havoc #t~mem68; {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 129: Hoare triple {109552#false} assume !(~num1~0 > 0); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 130: Hoare triple {109552#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 131: Hoare triple {109552#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 132: Hoare triple {109552#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 133: Hoare triple {109552#false} ~skip~0 := 0; {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 134: Hoare triple {109552#false} assume !false; {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 135: Hoare triple {109552#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,671 INFO L290 TraceCheckUtils]: 136: Hoare triple {109552#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 137: Hoare triple {109552#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 138: Hoare triple {109552#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 139: Hoare triple {109552#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 140: Hoare triple {109552#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 141: Hoare triple {109552#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 142: Hoare triple {109552#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 143: Hoare triple {109552#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 144: Hoare triple {109552#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 145: Hoare triple {109552#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 146: Hoare triple {109552#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 147: Hoare triple {109552#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 148: Hoare triple {109552#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,672 INFO L290 TraceCheckUtils]: 149: Hoare triple {109552#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 150: Hoare triple {109552#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 151: Hoare triple {109552#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 152: Hoare triple {109552#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 153: Hoare triple {109552#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 154: Hoare triple {109552#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 155: Hoare triple {109552#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 156: Hoare triple {109552#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 157: Hoare triple {109552#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 158: Hoare triple {109552#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 159: Hoare triple {109552#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 160: Hoare triple {109552#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 161: Hoare triple {109552#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 162: Hoare triple {109552#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,673 INFO L290 TraceCheckUtils]: 163: Hoare triple {109552#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {109552#false} is VALID [2022-04-27 15:33:54,674 INFO L290 TraceCheckUtils]: 164: Hoare triple {109552#false} assume 8640 == #t~mem75;havoc #t~mem75; {109552#false} is VALID [2022-04-27 15:33:54,674 INFO L290 TraceCheckUtils]: 165: Hoare triple {109552#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {109552#false} is VALID [2022-04-27 15:33:54,674 INFO L290 TraceCheckUtils]: 166: Hoare triple {109552#false} assume 4 == ~blastFlag~0; {109552#false} is VALID [2022-04-27 15:33:54,674 INFO L290 TraceCheckUtils]: 167: Hoare triple {109552#false} assume !false; {109552#false} is VALID [2022-04-27 15:33:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 15:33:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:33:54,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577392965] [2022-04-27 15:33:54,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577392965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:33:54,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:33:54,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:33:54,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392646744] [2022-04-27 15:33:54,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:33:54,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 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 168 [2022-04-27 15:33:54,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:33:54,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:33:54,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:33:54,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:33:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:33:54,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:33:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:33:54,754 INFO L87 Difference]: Start difference. First operand 1995 states and 2979 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:02,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:34:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:07,097 INFO L93 Difference]: Finished difference Result 4002 states and 5978 transitions. [2022-04-27 15:34:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:34:07,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 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 168 [2022-04-27 15:34:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-27 15:34:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 440 transitions. [2022-04-27 15:34:07,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 440 transitions. [2022-04-27 15:34:07,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 440 edges. 440 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:07,543 INFO L225 Difference]: With dead ends: 4002 [2022-04-27 15:34:07,543 INFO L226 Difference]: Without dead ends: 2035 [2022-04-27 15:34:07,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 15:34:07,545 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 151 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:07,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 371 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-27 15:34:07,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2022-04-27 15:34:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2031. [2022-04-27 15:34:07,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:07,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:07,689 INFO L74 IsIncluded]: Start isIncluded. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:07,691 INFO L87 Difference]: Start difference. First operand 2035 states. Second operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:07,806 INFO L93 Difference]: Finished difference Result 2035 states and 3027 transitions. [2022-04-27 15:34:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3027 transitions. [2022-04-27 15:34:07,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:07,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:07,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 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 2035 states. [2022-04-27 15:34:07,811 INFO L87 Difference]: Start difference. First operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 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 2035 states. [2022-04-27 15:34:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:07,923 INFO L93 Difference]: Finished difference Result 2035 states and 3027 transitions. [2022-04-27 15:34:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3027 transitions. [2022-04-27 15:34:07,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:07,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:07,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:07,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2026 states have (on average 1.4901283316880554) internal successors, (3019), 2026 states have internal predecessors, (3019), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3023 transitions. [2022-04-27 15:34:08,066 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3023 transitions. Word has length 168 [2022-04-27 15:34:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:08,066 INFO L495 AbstractCegarLoop]: Abstraction has 2031 states and 3023 transitions. [2022-04-27 15:34:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3023 transitions. [2022-04-27 15:34:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-27 15:34:08,068 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:08,068 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-27 15:34:08,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-27 15:34:08,068 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 428867290, now seen corresponding path program 1 times [2022-04-27 15:34:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:08,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654166730] [2022-04-27 15:34:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:08,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {120263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {120254#true} is VALID [2022-04-27 15:34:08,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {120254#true} assume true; {120254#true} is VALID [2022-04-27 15:34:08,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120254#true} {120254#true} #689#return; {120254#true} is VALID [2022-04-27 15:34:08,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {120254#true} call ULTIMATE.init(); {120263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:34:08,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {120263#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {120254#true} is VALID [2022-04-27 15:34:08,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {120254#true} assume true; {120254#true} is VALID [2022-04-27 15:34:08,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120254#true} {120254#true} #689#return; {120254#true} is VALID [2022-04-27 15:34:08,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {120254#true} call #t~ret161 := main(); {120254#true} is VALID [2022-04-27 15:34:08,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {120254#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {120254#true} is VALID [2022-04-27 15:34:08,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {120254#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {120259#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-27 15:34:08,465 INFO L272 TraceCheckUtils]: 7: Hoare triple {120259#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {120260#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-27 15:34:08,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {120260#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:34:08,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:34:08,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:34:08,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-27 15:34:08,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {120261#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {120262#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {120262#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {120255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {120255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {120255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {120255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {120255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {120255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {120255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {120255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {120255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {120255#false} assume 8464 == #t~mem55;havoc #t~mem55; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {120255#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {120255#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {120255#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {120255#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {120255#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {120255#false} ~skip~0 := 0; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {120255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {120255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {120255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {120255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 36: Hoare triple {120255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 37: Hoare triple {120255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {120255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {120255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {120255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {120255#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {120255#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {120255#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {120255#false} assume 8496 == #t~mem58;havoc #t~mem58; {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {120255#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {120255#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120255#false} is VALID [2022-04-27 15:34:08,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {120255#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {120255#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {120255#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {120255#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {120255#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {120255#false} ~skip~0 := 0; {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {120255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {120255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {120255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {120255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,474 INFO L290 TraceCheckUtils]: 58: Hoare triple {120255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {120255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {120255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {120255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {120255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {120255#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {120255#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {120255#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 66: Hoare triple {120255#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {120255#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {120255#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {120255#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {120255#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 71: Hoare triple {120255#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {120255#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {120255#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {120255#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {120255#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {120255#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {120255#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {120255#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 79: Hoare triple {120255#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 80: Hoare triple {120255#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {120255#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {120255#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {120255#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 84: Hoare triple {120255#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 85: Hoare triple {120255#false} assume 8656 == #t~mem77;havoc #t~mem77; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 86: Hoare triple {120255#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 87: Hoare triple {120255#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 88: Hoare triple {120255#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 89: Hoare triple {120255#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {120255#false} assume !(0 == ~tmp___10~0); {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 91: Hoare triple {120255#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 92: Hoare triple {120255#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 93: Hoare triple {120255#false} ~skip~0 := 0; {120255#false} is VALID [2022-04-27 15:34:08,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {120255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 96: Hoare triple {120255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {120255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {120255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 99: Hoare triple {120255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 100: Hoare triple {120255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 101: Hoare triple {120255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 102: Hoare triple {120255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 103: Hoare triple {120255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 104: Hoare triple {120255#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 105: Hoare triple {120255#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,478 INFO L290 TraceCheckUtils]: 106: Hoare triple {120255#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 107: Hoare triple {120255#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 108: Hoare triple {120255#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 109: Hoare triple {120255#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 110: Hoare triple {120255#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 111: Hoare triple {120255#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 112: Hoare triple {120255#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 113: Hoare triple {120255#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 114: Hoare triple {120255#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 115: Hoare triple {120255#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 116: Hoare triple {120255#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 117: Hoare triple {120255#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 118: Hoare triple {120255#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {120255#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {120255#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 121: Hoare triple {120255#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 122: Hoare triple {120255#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 123: Hoare triple {120255#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 124: Hoare triple {120255#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 125: Hoare triple {120255#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 126: Hoare triple {120255#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 127: Hoare triple {120255#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 128: Hoare triple {120255#false} assume 8672 == #t~mem79;havoc #t~mem79; {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 129: Hoare triple {120255#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 130: Hoare triple {120255#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 131: Hoare triple {120255#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,480 INFO L290 TraceCheckUtils]: 132: Hoare triple {120255#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 133: Hoare triple {120255#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 134: Hoare triple {120255#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 135: Hoare triple {120255#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 136: Hoare triple {120255#false} ~skip~0 := 0; {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 137: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 138: Hoare triple {120255#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 139: Hoare triple {120255#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 140: Hoare triple {120255#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 141: Hoare triple {120255#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 142: Hoare triple {120255#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 143: Hoare triple {120255#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,481 INFO L290 TraceCheckUtils]: 144: Hoare triple {120255#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 145: Hoare triple {120255#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 146: Hoare triple {120255#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 147: Hoare triple {120255#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 148: Hoare triple {120255#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 149: Hoare triple {120255#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 150: Hoare triple {120255#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 151: Hoare triple {120255#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 152: Hoare triple {120255#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 153: Hoare triple {120255#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 154: Hoare triple {120255#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 155: Hoare triple {120255#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,482 INFO L290 TraceCheckUtils]: 156: Hoare triple {120255#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 157: Hoare triple {120255#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 158: Hoare triple {120255#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 159: Hoare triple {120255#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 160: Hoare triple {120255#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 161: Hoare triple {120255#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 162: Hoare triple {120255#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 163: Hoare triple {120255#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 164: Hoare triple {120255#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 165: Hoare triple {120255#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 166: Hoare triple {120255#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 167: Hoare triple {120255#false} assume 8640 == #t~mem75;havoc #t~mem75; {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 168: Hoare triple {120255#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {120255#false} is VALID [2022-04-27 15:34:08,483 INFO L290 TraceCheckUtils]: 169: Hoare triple {120255#false} assume 4 == ~blastFlag~0; {120255#false} is VALID [2022-04-27 15:34:08,484 INFO L290 TraceCheckUtils]: 170: Hoare triple {120255#false} assume !false; {120255#false} is VALID [2022-04-27 15:34:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-27 15:34:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654166730] [2022-04-27 15:34:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654166730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:34:08,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:34:08,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:34:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143730213] [2022-04-27 15:34:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:34:08,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-27 15:34:08,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:34:08,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:08,548 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-27 15:34:08,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:34:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:34:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:34:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:34:08,549 INFO L87 Difference]: Start difference. First operand 2031 states and 3023 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:17,186 INFO L93 Difference]: Finished difference Result 4055 states and 6038 transitions. [2022-04-27 15:34:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:34:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2022-04-27 15:34:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:34:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:34:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-27 15:34:17,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-27 15:34:17,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:34:17,642 INFO L225 Difference]: With dead ends: 4055 [2022-04-27 15:34:17,643 INFO L226 Difference]: Without dead ends: 2031 [2022-04-27 15:34:17,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:34:17,646 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:34:17,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-27 15:34:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2022-04-27 15:34:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2031. [2022-04-27 15:34:17,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:34:17,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,814 INFO L74 IsIncluded]: Start isIncluded. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,815 INFO L87 Difference]: Start difference. First operand 2031 states. Second operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:17,916 INFO L93 Difference]: Finished difference Result 2031 states and 3022 transitions. [2022-04-27 15:34:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-27 15:34:17,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:17,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:17,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 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 2031 states. [2022-04-27 15:34:17,921 INFO L87 Difference]: Start difference. First operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 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 2031 states. [2022-04-27 15:34:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:34:18,022 INFO L93 Difference]: Finished difference Result 2031 states and 3022 transitions. [2022-04-27 15:34:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-27 15:34:18,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:34:18,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:34:18,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:34:18,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:34:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 2026 states have (on average 1.4896347482724581) internal successors, (3018), 2026 states have internal predecessors, (3018), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3022 transitions. [2022-04-27 15:34:18,136 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3022 transitions. Word has length 171 [2022-04-27 15:34:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:34:18,136 INFO L495 AbstractCegarLoop]: Abstraction has 2031 states and 3022 transitions. [2022-04-27 15:34:18,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:34:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3022 transitions. [2022-04-27 15:34:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-27 15:34:18,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:34:18,138 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-27 15:34:18,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-27 15:34:18,139 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:34:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:34:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1494383140, now seen corresponding path program 1 times [2022-04-27 15:34:18,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:34:18,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068093046] [2022-04-27 15:34:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:18,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:34:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:19,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:34:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:19,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {131027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {131013#true} is VALID [2022-04-27 15:34:19,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {131013#true} assume true; {131013#true} is VALID [2022-04-27 15:34:19,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131013#true} {131013#true} #689#return; {131013#true} is VALID [2022-04-27 15:34:19,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {131013#true} call ULTIMATE.init(); {131027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:34:19,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {131027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {131013#true} is VALID [2022-04-27 15:34:19,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {131013#true} assume true; {131013#true} is VALID [2022-04-27 15:34:19,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131013#true} {131013#true} #689#return; {131013#true} is VALID [2022-04-27 15:34:19,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {131013#true} call #t~ret161 := main(); {131013#true} is VALID [2022-04-27 15:34:19,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {131013#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {131018#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:34:19,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {131018#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(76);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 136 + ~s~0.offset, 4);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 136 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet29 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet29 % 4294967296 % 4294967296 else #t~nondet29 % 4294967296 % 4294967296 - 4294967296), #t~mem28.base, 36 + #t~mem28.offset, 4);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {131019#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} is VALID [2022-04-27 15:34:19,240 INFO L272 TraceCheckUtils]: 7: Hoare triple {131019#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 84)) 0) (<= main_~s~0.offset 0) (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 176 main_~s~0.offset)))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {131020#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-27 15:34:19,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {131020#(and (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 84 |ssl3_accept_#in~s.offset|)) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 176 |ssl3_accept_#in~s.offset|)))) (<= |ssl3_accept_#in~s.offset| 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !false; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 8464 == #t~mem55;havoc #t~mem55; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} is VALID [2022-04-27 15:34:19,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {131021#(and (<= ssl3_accept_~s.offset 0) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 0))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8496 == #t~mem58;havoc #t~mem58; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} ~skip~0 := 0; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !false; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,267 INFO L290 TraceCheckUtils]: 56: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,267 INFO L290 TraceCheckUtils]: 57: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,267 INFO L290 TraceCheckUtils]: 58: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,268 INFO L290 TraceCheckUtils]: 59: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,268 INFO L290 TraceCheckUtils]: 60: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,269 INFO L290 TraceCheckUtils]: 61: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,270 INFO L290 TraceCheckUtils]: 63: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,270 INFO L290 TraceCheckUtils]: 65: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,273 INFO L290 TraceCheckUtils]: 70: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,274 INFO L290 TraceCheckUtils]: 73: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,274 INFO L290 TraceCheckUtils]: 74: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,275 INFO L290 TraceCheckUtils]: 75: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,275 INFO L290 TraceCheckUtils]: 76: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,277 INFO L290 TraceCheckUtils]: 79: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,277 INFO L290 TraceCheckUtils]: 80: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,277 INFO L290 TraceCheckUtils]: 81: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,278 INFO L290 TraceCheckUtils]: 82: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,278 INFO L290 TraceCheckUtils]: 83: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,279 INFO L290 TraceCheckUtils]: 84: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,279 INFO L290 TraceCheckUtils]: 85: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} assume 8656 == #t~mem77;havoc #t~mem77; {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} is VALID [2022-04-27 15:34:19,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {131022#(and (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84))) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 176)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,280 INFO L290 TraceCheckUtils]: 87: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,282 INFO L290 TraceCheckUtils]: 89: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,282 INFO L290 TraceCheckUtils]: 90: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == ~tmp___10~0); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,283 INFO L290 TraceCheckUtils]: 92: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,283 INFO L290 TraceCheckUtils]: 93: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} ~skip~0 := 0; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,283 INFO L290 TraceCheckUtils]: 94: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !false; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,284 INFO L290 TraceCheckUtils]: 95: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,284 INFO L290 TraceCheckUtils]: 96: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,284 INFO L290 TraceCheckUtils]: 97: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,285 INFO L290 TraceCheckUtils]: 98: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,285 INFO L290 TraceCheckUtils]: 99: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,286 INFO L290 TraceCheckUtils]: 100: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,286 INFO L290 TraceCheckUtils]: 101: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,286 INFO L290 TraceCheckUtils]: 102: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,287 INFO L290 TraceCheckUtils]: 103: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,287 INFO L290 TraceCheckUtils]: 104: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,287 INFO L290 TraceCheckUtils]: 105: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,288 INFO L290 TraceCheckUtils]: 108: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,289 INFO L290 TraceCheckUtils]: 109: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,290 INFO L290 TraceCheckUtils]: 111: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,290 INFO L290 TraceCheckUtils]: 112: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,290 INFO L290 TraceCheckUtils]: 113: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,291 INFO L290 TraceCheckUtils]: 114: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,291 INFO L290 TraceCheckUtils]: 115: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,291 INFO L290 TraceCheckUtils]: 116: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,292 INFO L290 TraceCheckUtils]: 117: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,292 INFO L290 TraceCheckUtils]: 118: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,292 INFO L290 TraceCheckUtils]: 119: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,293 INFO L290 TraceCheckUtils]: 120: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,293 INFO L290 TraceCheckUtils]: 121: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,293 INFO L290 TraceCheckUtils]: 122: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,294 INFO L290 TraceCheckUtils]: 123: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,294 INFO L290 TraceCheckUtils]: 124: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,295 INFO L290 TraceCheckUtils]: 125: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,295 INFO L290 TraceCheckUtils]: 126: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,295 INFO L290 TraceCheckUtils]: 127: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,296 INFO L290 TraceCheckUtils]: 128: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 8672 == #t~mem79;havoc #t~mem79; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,296 INFO L290 TraceCheckUtils]: 130: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} is VALID [2022-04-27 15:34:19,297 INFO L290 TraceCheckUtils]: 131: Hoare triple {131023#(<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {131024#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} is VALID [2022-04-27 15:34:19,298 INFO L290 TraceCheckUtils]: 132: Hoare triple {131024#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))) (not (= (+ (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 84)) 792) ssl3_accept_~s.offset)))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,299 INFO L290 TraceCheckUtils]: 133: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,299 INFO L290 TraceCheckUtils]: 134: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,299 INFO L290 TraceCheckUtils]: 135: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,300 INFO L290 TraceCheckUtils]: 136: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,300 INFO L290 TraceCheckUtils]: 137: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,300 INFO L290 TraceCheckUtils]: 138: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,301 INFO L290 TraceCheckUtils]: 139: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,301 INFO L290 TraceCheckUtils]: 140: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,301 INFO L290 TraceCheckUtils]: 141: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,302 INFO L290 TraceCheckUtils]: 142: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,302 INFO L290 TraceCheckUtils]: 143: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,303 INFO L290 TraceCheckUtils]: 144: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,303 INFO L290 TraceCheckUtils]: 145: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,303 INFO L290 TraceCheckUtils]: 146: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,304 INFO L290 TraceCheckUtils]: 147: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,304 INFO L290 TraceCheckUtils]: 148: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,304 INFO L290 TraceCheckUtils]: 149: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,305 INFO L290 TraceCheckUtils]: 150: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,305 INFO L290 TraceCheckUtils]: 151: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,305 INFO L290 TraceCheckUtils]: 152: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,306 INFO L290 TraceCheckUtils]: 153: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,306 INFO L290 TraceCheckUtils]: 154: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,306 INFO L290 TraceCheckUtils]: 155: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,307 INFO L290 TraceCheckUtils]: 156: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,307 INFO L290 TraceCheckUtils]: 157: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,307 INFO L290 TraceCheckUtils]: 158: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 159: Hoare triple {131025#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {131026#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 160: Hoare triple {131026#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 161: Hoare triple {131014#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 162: Hoare triple {131014#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 163: Hoare triple {131014#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 164: Hoare triple {131014#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 165: Hoare triple {131014#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,308 INFO L290 TraceCheckUtils]: 166: Hoare triple {131014#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {131014#false} is VALID [2022-04-27 15:34:19,309 INFO L290 TraceCheckUtils]: 167: Hoare triple {131014#false} assume 8640 == #t~mem75;havoc #t~mem75; {131014#false} is VALID [2022-04-27 15:34:19,309 INFO L290 TraceCheckUtils]: 168: Hoare triple {131014#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {131014#false} is VALID [2022-04-27 15:34:19,309 INFO L290 TraceCheckUtils]: 169: Hoare triple {131014#false} assume 4 == ~blastFlag~0; {131014#false} is VALID [2022-04-27 15:34:19,309 INFO L290 TraceCheckUtils]: 170: Hoare triple {131014#false} assume !false; {131014#false} is VALID [2022-04-27 15:34:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 169 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:34:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:34:19,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068093046] [2022-04-27 15:34:19,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068093046] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:34:19,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800662259] [2022-04-27 15:34:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:34:19,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:34:19,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:34:19,312 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-27 15:34:19,313 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-27 15:34:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:20,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 235 conjunts are in the unsatisfiable core [2022-04-27 15:34:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:34:20,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:34:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:35:43,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:37:34,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 15:38:18,527 INFO L190 IndexEqualityManager]: detected not equals via solver